Up to equimorphism, hyperarithmetic is recursive (Q5718664): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability-theoretic and proof-theoretic aspects of partial and linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metamathematics of scattered linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fraissé's order type conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of orderings not isomorphic to recursive linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank

Latest revision as of 15:18, 11 June 2024

scientific article; zbMATH DE number 2247416
Language Label Description Also known as
English
Up to equimorphism, hyperarithmetic is recursive
scientific article; zbMATH DE number 2247416

    Statements

    Up to equimorphism, hyperarithmetic is recursive (English)
    0 references
    0 references
    16 January 2006
    0 references
    0 references
    recursive linear ordering
    0 references
    recursive presentability
    0 references
    hyperarithmetic linear ordering
    0 references
    Hausdorff rank
    0 references
    equimorphism types
    0 references
    0 references