首页 | 本学科首页   官方微博 | 高级检索  
     


Saving the Truth Schema from Paradox
Authors:Field  Hartry
Affiliation:(1) New York University, NY 10011, USA
Abstract:The paper shows how we can add a truth predicate to arithmetic (or formalized syntactic theory), and keep the usual truth schema Tr(langArang)harrA (understood as the conjunction of Tr(langArang)rarrA and ArarrTr(langArang)). We also keep the full intersubstitutivity of Tr(langArang)) with A in all contexts, even inside of an rarr. Keeping these things requires a weakening of classical logic; I suggest a logic based on the strong Kleene truth tables, but with rarr as an additional connective, and where the effect of classical logic is preserved in the arithmetic or formal syntax itself. Section 1 is an introduction to the problem and some of the difficulties that must be faced, in particular as to the logic of the rarr; Section 2 gives a construction of an arithmetically standard model of a truth theory; Section 3 investigates the logical laws that result from this; and Section 4 provides some philosophical commentary.
Keywords:conditionals  law of excluded middle  paradoxes  truth
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号