Finding paths through narrow and wide trees

DOI10.2178/jsl/1231082316zbMath1161.03035arXiv1408.2857OpenAlexW3102480368MaRDI QIDQ3616357

Stephen Binns, Bjørn Kjos-Hanssen

Publication date: 25 March 2009

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

Full work available at URL: https://arxiv.org/abs/1408.2857

zbMATH Keywords

treereverse mathematicsWKLWWKLKönig's Lemma

Mathematics Subject Classification ID

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

Related Items

On effectively closed sets of effective strong measure zero ⋮ A Cappable Almost Everywhere Dominating Computably Enumerable Degree ⋮ Unified characterizations of lowness properties via Kolmogorov complexity

Cites Work

• Vitali's theorem and WWKL
• Kolmogorov complexity and the Recursion Theorem
• Comparing DNR and WWKL
• Class groups of integral group rings
• Unnamed Item
• Unnamed Item