Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 35, Number 3 (1994), 311-327.
A System of Complete and Consistent Truth
To the axioms of Peano arithmetic formulated in a language with an additional unary predicate symbol T we add the rules of necessitation and conecessitation T and axioms stating that T commutes with the logical connectives and quantifiers. By a result of McGee this theory is -inconsistent, but it can be approximated by models obtained by a kind of rule-of-revision semantics. Furthermore we prove that FS is equivalent to a system already studied by Friedman and Sheard and give an analysis of its proof theory.
Notre Dame J. Formal Logic Volume 35, Number 3 (1994), 311-327.
First available in Project Euclid: 21 December 2002
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Halbach, Volker. A System of Complete and Consistent Truth. Notre Dame J. Formal Logic 35 (1994), no. 3, 311--327. doi:10.1305/ndjfl/1040511340. http://projecteuclid.org/euclid.ndjfl/1040511340.