INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS (Q5485751): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of recursive structures in arithmetical degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction for recursive linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of Ramsey's theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse mathematics and ordinal exponentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fraissé's order type conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Up to equimorphism, hyperarithmetic is recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between Fraïssé's conjecture and Jullien's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariants, Boolean algebras and ACA₀⁺ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive well-orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing with tagged trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:47, 24 June 2024

scientific article; zbMATH DE number 5051082
Language Label Description Also known as
English
INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
scientific article; zbMATH DE number 5051082

    Statements

    INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS (English)
    0 references
    0 references
    4 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    reverse mathematics
    0 references
    hyperarithmetic analysis
    0 references
    indecomposable linear orders
    0 references
    finitely terminating games
    0 references
    iterations of the Turing jump
    0 references