Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T05:47:05.328Z Has data issue: false hasContentIssue false

Finding paths through narrow and wide trees

Published online by Cambridge University Press:  12 March 2014

Stephen Binns
Affiliation:
Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia, E-mail: binns@kfupm.edu.sa
Bjørn Kjos-Hanssen
Affiliation:
Department of Mathematics, University of Hawai‘i at Mānoa, Honolulu, Hi 96822, USA, E-mail: bjoern@math.hawaii.edu

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable