THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES

DOI10.1017/JSL.2023.39MaRDI QIDQ6180600zbMATH OpenOpenAlexFDO

Authors Jun Le Goh

Publication date 22 December 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.2023.39

zbMATH Keywords

reverse mathematicsfinite choicearithmetic Bolzano-Weierstrass theoremtheories of hyperarithmetic analysissteel forcing

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Hierarchies of computability and definability (03D55) Second- and higher-order arithmetic and fragments (03F35)

Cites work

• scientific article; zbMATH DE number 3176053 (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?)
• Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
• Forcing with tagged trees
• Graph theory
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
• On the Π₁ ¹ -separation principle
• Recursive Pseudo-Well-Orderings
• Subsystems of second order arithmetic
• THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
• Über die Maximalzahl fremder unendlicher Wege in Graphen

Cited in

(2)

• Choice functions and well-orderings over the infinite binary tree
• Connecting real and hyperarithmetical analysis

This page was built for publication: THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES

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