Translator Disclaimer
March 2009 Finding paths through narrow and wide trees
Stephen Binns, Bjørn Kjos-Hanssen
J. Symbolic Logic 74(1): 349-360 (March 2009). DOI: 10.2178/jsl/1231082316

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.

Citation

Download Citation

Stephen Binns. Bjørn Kjos-Hanssen. "Finding paths through narrow and wide trees." J. Symbolic Logic 74 (1) 349 - 360, March 2009. https://doi.org/10.2178/jsl/1231082316

Information

Published: March 2009
First available in Project Euclid: 4 January 2009

zbMATH: 1161.03035
MathSciNet: MR2499434
Digital Object Identifier: 10.2178/jsl/1231082316

Rights: Copyright © 2009 Association for Symbolic Logic

JOURNAL ARTICLE
12 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.74 • No. 1 • March 2009
Back to Top