Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/176007
Title: | Non-finite axiomatizability of first-order Peano Arithmetic |
Author: | Berdugo Parada, Sandra |
Director/Tutor: | Casanovas Ruiz-Fornells, Enrique |
Keywords: | Teoria de models Treballs de fi de grau Teoria de la prova Model theory Bachelor's theses Proof theory |
Issue Date: | 19-Jun-2020 |
Abstract: | [en] The system of Peano Arithmetic is a system more than enough for proving almost all statements of the natural numbers. We will work with a version of this system adapted to first-order logic, denoted as PA. The aim of this work will be showing that there is no equivalent finitely axiomatizable system. In order to do this, we will introduce some concepts about the complexity of formulas and codification of sequences to prove Ryll-Nardzewski’s theorem, which states that there is no consistent extension of PA finitely axiomatized. |
Note: | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2020, Director: Enrique Casanovas Ruiz-Fornells |
URI: | http://hdl.handle.net/2445/176007 |
Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
176007.pdf | Memòria | 513.82 kB | Adobe PDF | View/Open |
This item is licensed under a
Creative Commons License