ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS

DOI10.1017/JSL.2022.58zbMATH Open1525.03056OpenAlexW4289202882WikidataQ113858275 ScholiaQ113858275MaRDI QIDQ6103458FDOQ6103458

Authors: Richard A. Shore 

Publication date: 5 June 2023

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

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

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

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) Infinite graphs (05C63) Foundations of classical theories (including reverse mathematics) (03B30) Hierarchies of computability and definability (03D55) Other constructive mathematics (03F65) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

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

Cited In (2)

• Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
• Connecting real and hyperarithmetical analysis

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)