INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
From MaRDI portal
Publication:5485751
DOI10.1142/S0219061306000517zbMath1105.03061MaRDI QIDQ5485751
Publication date: 4 September 2006
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
reverse mathematicshyperarithmetic analysisfinitely terminating gamesindecomposable linear ordersiterations of the Turing jump
Total orders (06A05) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)
Related Items (18)
Countable sets versus sets that are countable in reverse mathematics ⋮ Reverse Mathematics: The Playground of Logic ⋮ Open Questions in Reverse Mathematics ⋮ THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Complete Determinacy and Subsystems of Second Order Arithmetic ⋮ THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle ⋮ On the Π1 1 -separation principle ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Necessary use of induction in a reversal ⋮ Linear orders: When embeddability and epimorphism agree ⋮ THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM ⋮ Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
Cites Work
- Stability of recursive structures in arithmetical degrees
- Reverse mathematics and ordinal exponentiation
- Computable structures and the hyperarithmetical hierarchy
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- On Fraissé's order type conjecture
- On the strength of Ramsey's theorem for pairs
- Hierarchies of number-theoretic predicates
- Recursive well-orderings
- A construction for recursive linear orderings
- Forcing with tagged trees
- Invariants, Boolean algebras and ACA₀⁺
- Up to equimorphism, hyperarithmetic is recursive
This page was built for publication: INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
