This paper addresses the question: given some theory T that we accept, is there some natural, generally applicable way of extending T to a theory S that can prove a range of things about what it itself (i.e. S) can prove, including a range of things about what it cannot prove, such as claims to the effect that it cannot prove certain particular sentences (e.g. 0 = 1), or the claim that it is consistent? Typical characterizations of Gödel’s second incompleteness (...) theorem, and its significance, would lead us to believe that the answer is ‘no’. But the present paper explores a positive answer. The general approach is to follow the lead of recent (and not so recent) approaches to truth and the Liar paradox. (shrink)

We argue that distinct conditionals—conditionals that are governed by different logics—are needed to formalize the rules of Truth Introduction and Truth Elimination. We show that revision theory, when enriched with the new conditionals, yields an attractive theory of truth. We go on to compare this theory with one recently proposed by Hartry Field.

This article informally presents a solution to the paradoxes of truth and shows how the solution solves classical paradoxes (such as the original Liar) as well as the paradoxes that were invented as counterarguments for various proposed solutions (“the revenge of the Liar”). This solution complements the classical procedure of determining the truth values of sentences by its own failure and, when the procedure fails, through an appropriate semantic shift allows us to express the failure in a classical two-valued language. (...) Formally speaking, the solution is a language with one meaning of symbols and two valuations of the truth values of sentences. The primary valuation is a classical valuation that is partial in the presence of the truth predicate. It enables us to determine the classical truth value of a sentence or leads to the failure of that determination. The language with the primary valuation is precisely the largest intrinsic fixed point of the strong Kleene three-valued semantics (LIFPSK3). The semantic shift that allows us to express the failure of the primary valuation is precisely the classical closure of LIFPSK3: it extends LIFPSK3 to a classical language in parts where LIFPSK3 is undetermined. Thus, this article provides an argumentation, which has not been present in contemporary debates so far, for the choice of LIFPSK3 and its classical closure as the right model for the truth predicate. In the end, an erroneous critique of Kripke-Feferman axiomatic theory of truth, which is present in contemporary literature, is pointed out. (shrink)

Kripke [1975] gives a formal theory of truth based on Kleene's strong evaluation scheme. It is probably the most important and influential that has yet been given—at least since Tarski. However, it has been argued that this theory has a problem with generalized quantifiers such as All—that is, All ϕs are ψ—or Most. Specifically, it has been argued that such quantifiers preclude the existence of just the sort of language that Kripke aims to deliver—one that contains its own truth predicate. (...) In this paper I solve the problem by showing how Kleene's strong scheme, and Kripke's theory based on it, can in a natural way be extended to accommodate the full range of generalized quantifiers. (shrink)

To resolve putative liar paradoxes it is sufficient to attend to the distinction between liar-sentences and the propositions they would express, and to exercise the option of turning would-be deductions of paradox (of contradictions) into reductions of the existence of those propositions. Defending the coherence of particular resolutions along these lines, leads to recognition of the non-extensionality of some liar-sentences. In particular, it turns out that exchanges of terms for identicals in the open-sentence '- does not expression a true proposition' (...) are not invariably truth-preserving because they are not invariably proposition-expression preserving. All of this recommends propositions as fruitful subjects of interesting renewed research. (shrink)

A modification of Kripke’s theory of truth is proposed and it is shown how this modification solves some of the problems of expressive weakness in Kripke’s theory. This is accomplished by letting truth values be grounded in facts about other sentences’ ungroundedness.

At some step in proving the Liar Paradox in natural language, a sentence is derived that seems overdetermined with respect to its semantic value. This is complemented by Tarski’s Theorem that a formal language cannot consistently contain a naive truth predicate given the laws of logic used in proving the Liar paradox. I argue that proofs of the Eubulidean Liar either use a principle of truth with non-canonical names in a fallacious way or make a fallacious use of substitution of (...) identicals. Tarski never committed the first fallacy and may have himself considered it fallacious. Nevertheless, I clarify that it is fallacious. I then argue substitution of identicals needs to be restricted within the scope of the truth predicate. A logic for truth implementing this restriction is a monotonic extension of a classical first order logic, or indeed a formalizable fragment of natural language. Proofs of Tarski’s Indefinability of Truth theorem are invalid in this logic. This approach generalizes to invalidate proofs of Liar-like paradoxes, particularly the predicate form of the Knower paradox. Consequently, such a logic can be further extended in a way that avoids Montague’s theorem for such a system. Yet, the semantic status of a Liar sentence is not fully resolved. It is no longer overdetermined; it is now underdetermined. (shrink)

Consideration of a paradox originally discovered by John Buridan provides a springboard for a general solution to paradoxes within the Liar family. The solution rests on a philosophical defence of truth-value-gaps and is consistent (non-dialetheist), avoids ‘revenge’ problems, imports no ad hoc assumptions, is not applicable to only a proper subset of the semantic paradoxes and implies no restriction of the expressive capacities of language.