We deal with models of Peano arithmetic (specifically with a question of Ali Enayat). The methods are from creature forcing. We find an expansion of N such that its theory has models with no (elementary) end extensions. In fact there is a Borel uncountable set of subsets of N such that expanding N b
On End-Extensions of Models of ¬exp
✍ Scribed by Fernando Ferreira
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 1017 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Every model of IAo is the tally part of a model of the stringlanguage theory Th-FO (a main feature of which consists in having induction on notation restricted to certain AC! sets). We show how to "smoothly" introduce in Th-FO the binary length function, whereby it is possible to make exponential assumptions in models of Th-FO. These considerations entail that every model of IAo + l e x p is a proper initial segment of a model of Th-FO and that a modicum of bounded collection is true in these models.
📜 SIMILAR VOLUMES
We show that every model of Ido has an end extension to a model of a theory (extending Buss' S,") where log-space computable function are formalizable. We also show the existence of an isomotphism between models of Ido and models of linear arithmetic LA (i.e., second-order Presburger arithmetic wit
## Abstract This paper concerns intermediate structure lattices Lt(𝒩/ℳ︁), where 𝒩 is an almost minimal elementary end extension of the model ℳ︁ of Peano Arithmetic. For the purposes of this abstract only, let us say that ℳ︁ attains __L__ if __L__ ≅ Lt(𝒩/ℳ︁) for some almost minimal elementary end ex