A first-order theory of Ulm type
Logic
2017-02-23 v1
Abstract
The class of abelian -groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory whose models are each bi-interpretable with the disjoint union of an abelian -group and a pure set (and so that every abelian -group is bi-interpretable with a model of ) 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 , 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 -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