National and Kapodistrian University of Athens
End extensions of models of weak arithmetics
Abstract
dc:descriptionThe subject of the Ph.D Thesis is the study of problems concerning end extensions of models of subsystems of first-order Peano arithmetic (PA) in the first order language of arithmetic L A . More specifically the problem first posed by J. Paris, Is every model of Σ_1 -Collection a proper initial segment of a model of bounded induction? Remains unanswered.This problem was stated in an effort to miniaturize the famous McDowell-Specker Theorem that every model of PA has a proper elementary end extension. The main problem was studied by J. Paris and A. Wilkie who showed that a sufficient condition for a positive answer is that the model is I∆_0 -full (where I∆_0 denotes the theory of ∆_0 -induction).We show that the notion of I∆_0 -fullness can be by-passed by alternative proofs to these results which employ the classical argument of the Completeness theorem in its arithmetised form (Hilbert-Bernays) together with consistency statements referring to semantic tableaux methods.Furthermore, using the same methodology suitably modified we prove the generalisation of the result, namely that every countable model of Σ_n -Collection, n > 1, has a proper Σ_n -elementary end extension to a model of bounded induction.
Degree
thesis:*- Grantor dc:publisher
- National and Kapodistrian University of Athens
- Year dc:date
- 2016
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Paschalis, Vasileios
- Πασχάλης, Βασίλειος
Subjects
dc:subject × 14Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/39442