THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
From MaRDI portal
Publication:6180600
DOI10.1017/jsl.2023.39OpenAlexW4380536601MaRDI QIDQ6180600
Publication date: 22 December 2023
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2023.39
reverse mathematicsfinite choicearithmetic Bolzano-Weierstrass theoremtheories of hyperarithmetic analysissteel forcing
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Hierarchies of computability and definability (03D55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph Theory
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Necessary use of induction in a reversal
- THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
- On the Π1 1 -separation principle
- Forcing with tagged trees
- Über die Maximalzahl fremder unendlicher Wege in Graphen
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Recursive Pseudo-Well-Orderings
This page was built for publication: THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
