ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS

DOI10.1017/jsl.2022.58zbMath1525.03056OpenAlexW4289202882WikidataQ113858275 ScholiaQ113858275MaRDI QIDQ6103458

Richard A. Shore

Publication date: 5 June 2023

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

Full work available at URL: https://doi.org/10.1017/jsl.2022.58

zbMATH Keywords

locally finite graphsraysHalin's theoremtree forcing\(\Sigma_n^1\)-\(\mathrm{AC}_0\), \(\Sigma_\infty^1\)-\(\mathrm{AC}_0\)generalized \(\Pi_1^1\), \(r\)-\(\Pi_2^1\), and Tanaka conservativitytheorems of hyperarithmetic analysis

Mathematics Subject Classification ID

Paths and cycles (05C38) Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Other constructive mathematics (03F65) Second- and higher-order arithmetic and fragments (03F35) Infinite graphs (05C63) Hierarchies of computability and definability (03D55)

Related Items (1)

THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some conservation results on weak König's lemma
• Edge-disjoint double rays in infinite graphs: a Halin type result
• On the strength of Ramsey's theorem for pairs
• Graph Theory
• Necessary use of induction in a reversal
• The Baire category theorem in weak subsystems of second-order arithmetic
• Reverse Mathematics: The Playground of Logic
• Open Questions in Reverse Mathematics
• Slicing the Truth
• THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the Π₁ ¹ -separation principle
• The atomic model theorem and type omitting
• Forcing with tagged trees
• Some More Conservation Results on the Baire Category Theorem
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
• Higher set theory and mathematical practice
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS