National and Kapodistrian University of Athens
Θεωρία μοντέλων, με έμφαση στην αριθμητική
Abstract
dc:descriptionThere are a lot of proper subsystems of Peano Arithmetic. For some of these subsystems there are known theorems that provide us with information about their models. But there are quite enough subsystems, about which there are a lot of open questions. Major problems to be considered in this area are determining the position of a given subsystem in the hierarchy and finding the minimal theory for proving basic results in arithmetic. The clarification of the hierarchy of subsystems of Peano Arithmetic started in ’80. Some of the theorems that were proved are related to problems in other areas, like Computational Complexity and Number Theory. In chapters 2 and 3 of this thesis we are investigating the strength of specific subsystems. P. Clote and J. Krajicek published in 1993 a list of open problems, in which they included a lot of problems in bounded arithmetic, Proof Theory and Computational Complexity. The problems we study are from this list.The last chapter of the thesis concerns Peano Arithmetic within the framework of one non classical logic. Specifically, we study the not so old notion of a LP - model, concentrate on its properties and answer a few questions posed by G. Priest (1997, 2000). Our goal here is to better understand infinite LP-models, so that we can reach a characterization of such models. At the end of this chapter the close relation between classical and LP arithmetic is clarified.
Degree
thesis:*- Grantor dc:publisher
- National and Kapodistrian University of Athens
- Year dc:date
- 2007
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Sirokofskich, Alla
- Σιροκόφσκιχ, Άλλα
Subjects
dc:subject × 10Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/30609