The so-called weak K onig's lemma WKL asserts the existence of an inÿnite path b in any inÿnite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics b
✦ LIBER ✦
Ramsey’s theorem and König’s Lemma
✍ Scribed by T. E. Forster; J. K. Truss
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 117 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On uniform weak König's lemma
✍
Ulrich Kohlenbach
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 121 KB
Measure theory and weak König's lemma
✍
Xiaokang Yu; Stephen G. Simpson
📂
Article
📅
1990
🏛
Springer
🌐
English
⚖ 517 KB
On König's theorem
✍
L. A. Suprunenko
📂
Article
📅
1976
🏛
Springer US
🌐
English
⚖ 468 KB
Some conservation results on weak König'
✍
Stephen G. Simpson; Kazuyuki Tanaka; Takeshi Yamazaki
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 274 KB
By RCA0, we denote the system of second-order arithmetic based on recursive comprehension axioms and 0 1 induction. WKL0 is deÿned to be RCA0 plus weak K onig's lemma: every inÿnite tree of sequences of 0's and 1's has an inÿnite path. In this paper, we ÿrst show that for any countable model M of RC
Extension of KÖNIG's Lemma
✍
G. A. Dirac
📂
Article
📅
1969
🏛
John Wiley and Sons
🌐
English
⚖ 424 KB
König's lemma, the ω-Rule and primitive
✍
López-Escobar, E. G. K.
📂
Article
📅
1985
🏛
Springer-Verlag
⚖ 389 KB