Article contents
Finding paths through narrow and wide trees
Published online by Cambridge University Press: 12 March 2014
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2009
References
REFERENCES
- 3
- Cited by