Some formal systems based on partial truth definitions

• Grant number: 08/11481-1
• Support Opportunities: Scholarships in Brazil - Doctorate
• Start date: May 01, 2009
• End date: February 28, 2013
• Field of knowledge: Humanities - Philosophy - Logic
• Principal Investigator: Andrea Maria Altino de Campos Loparic
• Grantee: Luciano Vicente
• Host Institution: Faculdade de Filosofia, Letras e Ciências Humanas (FFLCH). Universidade de São Paulo (USP). São Paulo , SP, Brazil

Abstract

According to Boolos & Jeffrey: Tarski"s indefinability theorem is a "negative result [...] poised, so to speak, between two positive results: on the one hand, that each of certain 'approximations' Vn to V is definible in arithmetic, and, on the other, that V itself is 'definible in second-order arithmetic'". We intend to take such 'approximations' as privileged object of study, scrutinizing their "theory", the theory of partial truth definitions, and examining the possibility of basing on them a series of partial formalizations of the "truth predicate" of arithmetic.

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

VICENTE, Luciano. Partial truth definitions and accumulation systems in formal arithmetic. 2013. Doctoral Thesis - Universidade de São Paulo (USP). Faculdade de Filosofia, Letras e Ciências Humanas (FFLCH/SBD) São Paulo.