English

A first-order theory of Ulm type

Logic 2017-02-23 v1

Abstract

The class of abelian pp-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory TpT_p whose models are each bi-interpretable with the disjoint union of an abelian pp-group and a pure set (and so that every abelian pp-group is bi-interpretable with a model of TpT_p) using computable infinitary formulas. This answers a question of Knight by giving an example of an elementary first-order theory of "Ulm type": Any two models, low for ω1CK\omega_1^{CK}, and with the same computable infinitary theory, are isomorphic. It also gives a new example of an elementary first-order theory whose isomorphism problem is Σ11\mathbf{\Sigma}^1_1-complete but not Borel complete.

Keywords

Cite

@article{arxiv.1702.06586,
  title  = {A first-order theory of Ulm type},
  author = {Matthew Harrison-Trainor},
  journal= {arXiv preprint arXiv:1702.06586},
  year   = {2017}
}

Comments

12 pages

R2 v1 2026-06-22T18:24:41.192Z