Categoricity in hyperarithmetical degrees (Q1821772): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Stability of recursive structures in arithmetical degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsically \(\Sigma ^ 0_{\alpha}\) relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autostability and computable families of constructivizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantity of nonautoequivalent constructivizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank

Latest revision as of 18:32, 17 June 2024

scientific article
Language Label Description Also known as
English
Categoricity in hyperarithmetical degrees
scientific article

    Statements

    Categoricity in hyperarithmetical degrees (English)
    0 references
    0 references
    1987
    0 references
    We obtain, under certain assumptions, necessary and sufficient conditions for a recursive structure to be \(\Delta^ 0_{\alpha}\)-categorical. This is done using the author's \(\alpha\)-systems to construct suitable \(\Delta^ 0_{\alpha +1}\) functions. We show how these results may be applied, for example, to superatomic Boolean algebras.
    0 references
    recursive structure
    0 references
    superatomic Boolean algebras
    0 references

    Identifiers