INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
From MaRDI portal
Publication:5485751
DOI10.1142/S0219061306000517zbMATH Open1105.03061MaRDI QIDQ5485751FDOQ5485751
Publication date: 4 September 2006
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Recommendations
- Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
- Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- The metamathematics of scattered linear orderings
- On the Equimorphism Types of Linear Orderings
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)
Cites Work
- Computable structures and the hyperarithmetical hierarchy
- On Fraissé's order type conjecture
- On the strength of Ramsey's theorem for pairs
- A construction for recursive linear orderings
- Forcing with tagged trees
- Reverse mathematics and ordinal exponentiation
- Hierarchies of number-theoretic predicates
- Recursive well-orderings
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- Stability of recursive structures in arithmetical degrees
- Invariants, Boolean algebras and ACA₀⁺
- Up to equimorphism, hyperarithmetic is recursive
Cited In (20)
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- Necessary use of induction in a reversal
- THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
- Infinite dimensional proper subspaces of computable vector spaces
- Complete Determinacy and Subsystems of Second Order Arithmetic
- On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
- Reverse Mathematics: The Playground of Logic
- Open Questions in Reverse Mathematics
- THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle
- Linear orders: When embeddability and epimorphism agree
- Connecting real and hyperarithmetical analysis
- THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- On the Π1 1 -separation principle
- Countable sets versus sets that are countable in reverse mathematics
- Computability theory. Abstracts from the workshop held January 7--13, 2018
This page was built for publication: INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485751)
