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

DOI10.1017/JSL.2023.39OpenAlexW4380536601MaRDI QIDQ6180600FDOQ6180600

Authors: Jun Le Goh 

Publication date: 22 December 2023

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

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

• Subsystems of second order arithmetic
• Title not available (Why is that?)
• Graph theory
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Title not available (Why is that?)
• Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Recursive Pseudo-Well-Orderings
• Forcing with tagged trees
• THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
• Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
• Title not available (Why is that?)
• On the Π₁ ¹ -separation principle

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)