ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS

DOI10.1017/JSL.2022.58MaRDI QIDQ6103458zbMATH OpenOpenAlexWikidataFDO

Authors Richard A. Shore

Publication date 5 June 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

\(\Sigma_n^1\)-\(\mathrm{AC}_0\), \(\Sigma_\infty^1\)-\(\mathrm{AC}_0\)generalized \(\Pi_1^1\), \(r\)-\(\Pi_2^1\), and Tanaka conservativityHalin's theoremlocally finite graphsraystheorems of hyperarithmetic analysistree forcing

Mathematics Subject Classification ID

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

Recommendations

• Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
• Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs

Cites work

• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
• Edge-disjoint double rays in infinite graphs: a Halin type result
• Forcing with tagged trees
• Graph theory
• Higher set theory and mathematical practice
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
• Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
• On ^1_1 conservativity for ^1_2 theories in second order arithmetic
• On the strength of Ramsey's theorem for pairs
• On the Π₁ ¹ -separation principle
• Open questions in reverse mathematics
• Reverse mathematics: the playground of logic
• Slicing the truth. On the computable and reverse mathematics of combinatorial principles
• Some conservation results on weak König's lemma
• Some More Conservation Results on the Baire Category Theorem
• Subsystems of second order arithmetic
• The atomic model theorem and type omitting
• The Baire category theorem in weak subsystems of second-order arithmetic
• THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(3)

• Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
• Connecting real and hyperarithmetical analysis
• Halin's infinite ray theorems: complexity and reverse mathematics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103458)