Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 74, Issue 1 (2009), 349-360.
Finding paths through narrow and wide trees
We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak König's Lemma, and incomparable in strength to the dual statement (WWKL) that wide binary trees have paths.
J. Symbolic Logic, Volume 74, Issue 1 (2009), 349-360.
First available in Project Euclid: 4 January 2009
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Binns, Stephen; Kjos-Hanssen, Bjørn. Finding paths through narrow and wide trees. J. Symbolic Logic 74 (2009), no. 1, 349--360. doi:10.2178/jsl/1231082316. https://projecteuclid.org/euclid.jsl/1231082316