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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00153-011-0255-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017192911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Homogeneous Nilpotent Groups and Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing degrees of nonabelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4309352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability-Theoretic Complexity of Countable Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree spectra and computable dimensions in algebraic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nice Enumerations of ω-categorical Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: UPPER BOUNDS IN THE RESTRICTED BURNSIDE PROBLEM II / rank
 
Normal rank

Latest revision as of 22:15, 4 July 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
    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
    0 references