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
✦ LIBER ✦
König's lemma, the ω-Rule and primitive recursive arithmetic
✍ Scribed by López-Escobar, E. G. K.
- Publisher
- Springer-Verlag
- Year
- 1985
- Weight
- 389 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0003-9268
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Generalized additive bases, König's lemm
✍
Melvyn B. Nathanson
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 211 KB
Remarks on the cofinality of a partially
✍
E.C. Milner; N. Sauer
📂
Article
📅
1981
🏛
Elsevier Science
🌐
English
⚖ 694 KB
A problem concerning the cardinality of the cofinal subsets of a partially ordered set is reduced to an open problem irr graph tteory. Let A be an in&it: wdinal, V = Ui,, Vi, I Uiii VJC IVJ (i CA). J\_et G be a graph on V with the proper?y that whenever i <A, x=u ie,cA Vi and IXICIVil, then there is
On the Equivalence Between Logic-Free an
✍
Daniel G. Schwartz
📂
Article
📅
1987
🏛
John Wiley and Sons
🌐
English
⚖ 523 KB