THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
From MaRDI portal
Publication:5067874
DOI10.1017/bsl.2021.70zbMath1505.03025OpenAlexW4220822955WikidataQ113858364 ScholiaQ113858364MaRDI QIDQ5067874
James S. Barnes, Richard A. Shore, Jun Le Goh
Publication date: 4 April 2022
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/bsl.2021.70
Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Infinite graphs (05C63) Hierarchies of computability and definability (03D55)
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
- Graph Theory
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Necessary use of induction in a reversal
- Open Questions in Reverse Mathematics
- Slicing the Truth
- THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
- On the Π1 1 -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
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
- Higher set theory and mathematical practice
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
This page was built for publication: THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS