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
Measure theory and weak König's lemma
✍ Scribed by Xiaokang Yu; Stephen G. Simpson
- Publisher
- Springer
- Year
- 1990
- Tongue
- English
- Weight
- 517 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
Let A be a set of nonnegative integers. For every nonnegative integer n and positive integer h; let r A ðn; hÞ denote the number of representations of n in the form n where a 1 ; a 2 ; y; a h AA and a 1 pa 2 p?pa h : The infinite set A is called a basis of order h if r A ðn; hÞX1 for every nonnegat