A first-order theory of Ulm type
From MaRDI portal
Publication:5211069
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.
Recommendations
- The isomorphism problem for computable Abelian p-groups of bounded length
- Enumerating abelian \(p\)-groups
- Computability of the class of strongly constructivizable abelian \(p\)-groups
- Iterated effective embeddings of abelian \(p\)-groups
- Computability of the class of strongly constructivizable Abelian \(p\)-groups
Cited in
(4)
This page was built for publication: A first-order theory of Ulm type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211069)