Degrees of isomorphism types and countably categorical groups (Q661283): Difference between revisions

From MaRDI portal
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/S00153-011-0255-6 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00153-011-0255-6 / rank
 
Normal rank

Latest revision as of 00:17, 10 December 2024

scientific article
Language Label Description Also known as
English
Degrees of isomorphism types and countably categorical groups
scientific article

    Statements

    Degrees of isomorphism types and countably categorical groups (English)
    0 references
    10 February 2012
    0 references
    A countable structure with the universe \(\omega\) is said to be of (Turing) degree \(\mathbf{d}\) iff its atomic diagram has degree \(\mathbf{d}\). By the spectrum \(\mathrm{Spec}(\mathcal{M})\) of a structure \(\mathcal{M}\) we mean the set of degrees of structures isomorphic to \(\mathcal{M}\). If \(\mathrm{Spec}(\mathcal{M})\) has a least element \(\mathbf{d}\) then \(\mathcal{M}\) is said to have degree \(\mathbf{d}\); otherwise, we say that \(\mathcal{M}\) has no degree. The main result of the paper under review is following: Theorem. (i) For every Turing degree \(\mathbf{d}\) there is a 2-step nilpotent group \(\mathfrak{G}\) of exponent four so that \(\mathfrak{G}\) has a countably categorical theory submodel complete (i.e., with quantifier elimination) theory and has degree \(\mathbf{d}\). (ii) There is a 2-step nilpotent group \(\mathfrak{G}\) of exponent four so that \(\mathfrak{G}\) has a countably categorical theory submodel complete theory and has no degree. The author uses the Fraïssé method for constructing both series of examples.
    0 references
    degrees of isomorphism classes
    0 references
    degrees of structures
    0 references
    countably categorical groups
    0 references
    nilpotent groups
    0 references
    degrees of unsolvability
    0 references

    Identifiers