INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
From MaRDI portal
(Redirected from Publication:5485751)
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
Cites work
- A construction for recursive linear orderings
- Computable structures and the hyperarithmetical hierarchy
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- Forcing with tagged trees
- Hierarchies of number-theoretic predicates
- Invariants, Boolean algebras and ACA₀⁺
- On Fraissé's order type conjecture
- On the strength of Ramsey's theorem for pairs
- Recursive well-orderings
- Reverse mathematics and ordinal exponentiation
- Stability of recursive structures in arithmetical degrees
- Up to equimorphism, hyperarithmetic is recursive
Cited in
(22)- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
- Linear orders: when embeddability and epimorphism agree
- Reverse mathematics: the playground of logic
- Open questions in reverse mathematics
- Halin's infinite ray theorems: complexity and reverse mathematics
- Infinite dimensional proper subspaces of computable vector spaces
- Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
- Complete Determinacy and Subsystems of Second Order Arithmetic
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
- THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- On sequential theorems in reverse mathematics
- Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle
- Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
- Connecting real and hyperarithmetical analysis
- On the Π1 1 -separation principle
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- 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)
