Necessary use of induction in a reversal

DOI10.2178/jsl/1305810764zbMath1218.03005OpenAlexW2060740478MaRDI QIDQ3011120

Itay Neeman

Publication date: 28 June 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3930

zbMATH Keywords

indecomposablereverse mathematicsscatteredlinear orderings\(\Sigma ^1_{1}\)-inductionweak \(\Sigma ^1_{1}\)-choice

Mathematics Subject Classification ID

Applications of set theory (03E75) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Related Items

THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Generalized side-conditions and Moore-Mrówka ⋮ THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ Reverse mathematics of the uncountability of \(\mathbb{R}\)

Cites Work

• Unnamed Item
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the Equimorphism Types of Linear Orderings
• Determinacy of Wadge classes and subsystems of second order arithmetic
• Forcing with tagged trees
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS