Finding paths through narrow and wide trees

&
Journal of Symbolic Logic 74 (1):349-360 (2009)
  Copy   BIBTEX

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

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1231082316

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Some conservation results on weak König's lemma.Stephen G. Simpson, Kazuyuki Tanaka & Takeshi Yamazaki - 2002 - Annals of Pure and Applied Logic 118 (1-2):87-114.
Uniform versions of some axioms of second order arithmetic.Nobuyuki Sakamoto & Takeshi Yamazaki - 2004 - Mathematical Logic Quarterly 50 (6):587-593.
Uniform versions of some axioms of second order arithmetic.Nobuyuki Sakamoto & Takeshi Yamakazi - 2004 - Mathematical Logic Quarterly 50 (6):587-593.
On uniform weak König's lemma.Ulrich Kohlenbach - 2002 - Annals of Pure and Applied Logic 114 (1-3):103-116.
Measure theory and weak König's lemma.Xiaokang Yu & Stephen G. Simpson - 1990 - Archive for Mathematical Logic 30 (3):171-180.
Which set existence axioms are needed to prove the cauchy/peano theorem for ordinary differential equations?Stephen G. Simpson - 1984 - Journal of Symbolic Logic 49 (3):783-802.
Computability in uncountable binary trees.Reese Johnston - 2019 - Journal of Symbolic Logic 84 (3):1049-1098.
A feasible theory for analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.
Classes and theories of trees associated with a class of linear orders.Valentin Goranko & Ruaan Kellerman - 2011 - Logic Journal of the IGPL 19 (1):217-232.
The binary expansion and the intermediate value theorem in constructive reverse mathematics.Josef Berger, Hajime Ishihara, Takayuki Kihara & Takako Nemoto - 2019 - Archive for Mathematical Logic 58 (1-2):203-217.

Analytics

Added to PP
2010-09-12

Downloads
20 (#792,293)

6 months
1 (#1,516,001)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Bjørn Kjos-Hanssen
University of Hawaii

Citations of this work

On effectively closed sets of effective strong measure zero.Kojiro Higuchi & Takayuki Kihara - 2014 - Annals of Pure and Applied Logic 165 (9):1445-1469.

Add more citations

References found in this work

Uniform Almost Everywhere Domination.Peter Cholak, Noam Greenberg & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (3):1057 - 1072.
Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.
Vitali's Theorem and WWKL.Douglas K. Brown, Mariagnese Giusto & Stephen G. Simpson - 2002 - Archive for Mathematical Logic 41 (2):191-206.
A stronger form of a theorem of Friedberg.Kempachiro Ohashi - 1964 - Notre Dame Journal of Formal Logic 5 (1):10-12.

Add more references