Full text
| |
| Author(s): |
Luciano Vicente
Total Authors: 1
|
| Document type: | Doctoral Thesis |
| Press: | São Paulo. |
| Institution: | Universidade de São Paulo (USP). Faculdade de Filosofia, Letras e Ciências Humanas (FFLCH/SBD) |
| Defense date: | 2013-03-21 |
| Examining board members: |
Andrea Maria Altino de Campos Loparic;
Antonio Mariano Nogueira Coelho;
José Alexandre Durry Guerzoni;
Luiz Carlos Pinheiro Dias Pereira;
Luiz Henrique Lopes dos Santos
|
| Advisor: | Andrea Maria Altino de Campos Loparic |
| Abstract | |
According to Tarski-Gödels undefinability theorem, there is no formula in the language of arithmetic which defines the set of Gödel numbers of arithmetical true sentences. Nevertheless, for each n, we can define the set of Gödel numbers of all arithmetical true sentences of degree n or less. These definitions yield a hierarchy of predicates V0(x), V1(x),..., Vn(x),... such that, for all x, if Vn(x), then Vn+1(x). In this study, we will ensay some aplications of these predicates, called partial truth definitions, and others related ones in building of formal systems for arithmetical truth. The underlying idea of our systems is very simple, we should accumulate in some way the partial truth definitions. Roughly speaking, showing how we can do that is the aim of this study. (AU) | |
| FAPESP's process: | 08/11481-1 - Some formal systems based on partial truth definitions |
| Grantee: | Luciano Vicente |
| Support Opportunities: | Scholarships in Brazil - Doctorate |