Online research in philosophy

A new solution to the liar paradox is developed using the insight that it is illegitimate to even suppose (let alone assert) that a liar sentence has a truth-status (true or not) on the grounds that supposing this sentence to be true/not-true essentially defeats the telos of supposition in a readily identifiable way. On that basis, the paradox is blocked by restricting the Rule of Assumptions in Gentzen-style presentations of the sequent-calculus. The lesson of the liar is that not all assumptions are for free. One merit of this proposal is that it is free from the revenge problem.

Hartry Field’s book, Saving Truth from Paradox, is without question among the best works on truth and the liar paradox in the analytic tradition—it should become the standard reference on the liar paradox for years to come. Field offers lucid, technically accurate, but accessible discussions of most of the approaches to the liar paradox that are currently being debated in the literature. He also defends his favored approach, which requires a change from classical to paracomplete logic. After a brief flirtation with dialetheism around the turn of the century, he now offers a novel, powerful, and technically dazzling way of dealing with the liar paradox to accompany his influential version of disquotationalism.2 Together they provide a unified view of the nature and logic of truth.3 Field’s solution to the liar together with his fair and charitable discussion of the alternatives make this book required reading by anyone remotely interested in issues associated with truth, philosophical logic, and philosophy of language. The book covers much the same ground as several of Field’s recent papers on the liar paradox4, but this is not a collection; instead, Field has written the book from scratch in a way that informs the..

An eleventh-century Greek text, in which a fourth-century patristic text is discussed, gives an outline of a solution to the Liar Paradox. The eleventh-century text is probably the first medieval treatment of the Liar. Long passages from both texts are translated in this article. The solution to the Liar Paradox, which they entail, is analysed and compared with the results of modern scholarship on several Latin solutions to this paradox. It is found to be a solution, which bears some analogies to contemporary game semantics. Further, an overview of other Byzantine scholia on the Liar Paradox is provided. The findings and the originality of the discussed solution to the Liar Paradox suggest a change in the way in which Byzantine Logic is traditionally regarded in contemporary scholarship.

This volume includes a target paper, taking up the challenge to revive, within a modern (formal) framework, a medieval solution to the Liar Paradox which did ...

One recently proposed solution to the Liar paradox is the contextual theory of truth. Tyler Burge (1979) argues that truth is an indexical notion and that the extension of the truth predicate shifts during Liar reasoning. A Liar sentence might be true in one context and false in another. To many, contextualism seems to capture our pre-theoretic intuitions about the semantic paradoxes; this is especially due to its reliance on the so-called Revenge phenomenon. I, however, show that Super-Liar sentences (where a Super-Liar sentence is a sentence which says of itself that it is not true in any context) generate a significant problem for Burge’s contextual theory of truth.

In this paper, I examine a solution to the Liar paradox found in the work of Ockham, Burley, and Pseudo-Sherwood. I reject the accounts of this solution offered by modern commentators. I argue that this medieval line suggests a non-hierarchical solution to the Liar, according to which ?true? is analysed as an indexical term, and paradox is avoided by minimal restrictions on tokens of ?true?. In certain respects, this solution resembles the recent approaches of Charles Parsons and Tyler Burge; in other respects, it is related to a suggestion of Gödel. But, as a whole, it suggests an original solution to the Liar paradox, quite unlike any current proposals.

“To this day, partiality approaches to the paradox have been dogged by the so-called ‘Strengthened Liar’. .... The Strengthened Liar observes that if we follow a partiality theorist and declare the Liar sentence* neither true nor false (or failing to express a proposition,. or suffering from some sort of grave semantic defect), then the paradox is only pushed back. For we can go on to conclude that whatever this status may be, it implies that the Liar sentence is not true. This claim is true, but it is just the Liar sentence again.* We are back in paradox.” (Glanzberg 2002, p. 468, bold emphasis added.) Cf.: “We are back in our contradiction,”(Glanzberg 2001, p. 222). *The Liar sentence intended is evidently the sentence ‘the Liar sentence is not true’, and, the Liar sentence = ‘the Liar sentence is not true’. Cf.: “Consider a Liar sentence: ...let us take a sentence l which says l is not true. We can, informally, reason as..

The Liar Paradox is an argument that arrives at a contradiction by reasoning about a Liar Sentence. The classical Liar Sentence is the self-referential sentence “This sentence is false.”.

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: From ¬(p ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉).

The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker.

The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another.

Graham Priest (1994) has argued that the following paradoxes all have the same structure: Russell’s Paradox, Burali-Forti’s Paradox, Mirimanoff’s Paradox, König’s Paradox, Berry’s Paradox, Richard’s Paradox, the Liar and Liar Chain Paradoxes, the Knower and Knower Chain Paradoxes, and the Heterological Paradox. Their common structure is given by Russell’s Schema: there is a property φ and function δ such that..