Bounded arithmetic, collection principle, weak pigeonhole principle. ## MSC (2000) 03F30 We show that for each n ≥ 1, if T n 2 does not prove the weak pigeonhole principle for Σ b n functions, then the collection scheme BΣ1 is not finitely axiomatizable over T n 2 . The same result holds with S n
✦ LIBER ✦
A note on effective ultrapowers: Uniform failure of bounded collection
✍ Scribed by Thomas McLaughlin
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 302 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
By suitably adapting an argument of Hirschfeld (see [2, Chapter 9]), we show that there is a single Δ~1~ formula that defeats “bounded collection” for any model of II~2~ Arithmetic that is either a recursive ultrapower or an existentially complete model. Some related facts are noted. MSC: 03F30, 03C62.
📜 SIMILAR VOLUMES
A note on the Σ1 collection scheme and f
✍
Zofia Adamowicz; Leszek Aleksander Kołodziejczyk
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 115 KB
A note on the effect of mesh pattern on
✍
D. N. Sing; P. K. Basudhar
📂
Article
📅
1993
🏛
John Wiley and Sons
🌐
English
⚖ 430 KB