THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM

DOI10.1142/S0219061308000725zbMath1186.03071MaRDI QIDQ3396197

Itay Neeman

Publication date: 16 September 2009

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

reverse mathematicssecond-order arithmeticSteel forcingscattered linear orders\(\Delta_1^1\) comprehensionhyperarithmetic indecomposable linear ordersweak \(\Sigma_1^1\) choice

Mathematics Subject Classification ID

Consistency and independence results (03E35) 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 ⋮ 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

Cites Work

• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• On the Π₁ ¹ -separation principle
• Forcing with tagged trees
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS