โ Scribed by Domenico Zambella
No coin nor oath required. For personal study only.
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 with finite comprehension for bounded formulas).
๐ SIMILAR VOLUMES
## 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
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 as
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
The Inverse Galois problem remains a fascinating yet unanswered question. The standard approach through algebraic geometry is to construct a Galois branched covering of the projective line over the rationals with a desired group G. Then one invokes the Hilbert Irreducibility Theorem to construct a G