Deflationary Truth and the Liar

Journal of Philosophical Logic -     

Logic of Knowledge and Utterance and the Liar

We extend the ordinary logic of knowledge based on the operator K and the system of axioms S₅ by adding a new operator U, standing for the agent utters , and certain axioms and a rule for U, forming thus a new system KU. The main advantage of KU is that we can express in it intentions of the speaker concerning the truth or falsehood of the claims he utters and analyze them logically. Specifically we can express in the new language various notions of lying, as well as of telling the truth. Consequently, as long as lying or telling the truth about a fact is an intentional mode of the speaker, we can resolve the Liar paradox, or at least some of its variants, turning it into an ordinary (false or true) sentence. Also, using Kripke structures analogous to those employed by S. Kraus and D. Lehmann in [3] for modelling the logic of knowledge and belief, we offer a sound and complete semantics for KU.     

A Revenge-Immune Solution to the Semantic Paradoxes

The paper offers a solution to the semantic paradoxes, one in which (1) we keep the unrestricted truth schema True(A)A, and (2) the object language can include its own metalanguage. Because of the first feature, classical logic must be restricted, but full classical reasoning applies in ordinary contexts, including standard set theory. The more general logic that replaces classical logic includes a principle of substitutivity of equivalents, which with the truth schema leads to the general intersubstitutivity of True(A) with A within the language.The logic is also shown to have the resources required to represent the way in which sentences (like the Liar sentence and the Curry sentence) that lead to paradox in classical logic are defective. We can in fact define a hierarchy of defectiveness predicates within the language. Contrary to claims that any solution to the paradoxes just breeds further paradoxes (revenge problems) involving defectiveness predicates, there is a general consistency/conservativeness proof that shows that talk of truth and the various levels of defectiveness can all be made coherent together within a single object language.     

Why the Liar Does not Matter

This paper develops a classical model for our ordinary use of the truth predicate (1) that is able to address the liar's paradox and (2) that satisfies a very strong version of deflationism. Since the model is a classical in the sense that it has no truth value gaps, the model is able to address Tarski's indictment of our ordinary use of the predicate as inconsistent. Moreover, since it is able to address the liar's paradox, it responds to arguments against deflationism based upon that paradox alone. The model is based upon a notion of the complexity of propositions that a fixed set of speakers might express. A context-sensitive definition of the truth predicate is then provided based upon a class of possible worlds defined in terms of these speakers. Reasonable constraints on the memories and lifetimes of ordinary speakers are used to limit the set of propositions that they might express so that deflationist requirements are satisfied.     

What the Liar Taught Achilles

Zeno's paradoxes of motion and the semantic paradoxes of the Liar have long been thought to have metaphorical affinities. There are, in fact, isomorphisms between variations of Zeno's paradoxes and variations of the Liar paradox in infinite-valued logic. Representing these paradoxes in dynamical systems theory reveals fractal images and provides other geometric ways of visualizing and conceptualizing the paradoxes.     

A revision of the definition of lying as an untruth told with intent to deceive

The traditional and prevailing definition of lying is that lying is some variation or combination of: an untruth told with intent to deceive. I establish that this is the case, and that, as a result, contradictions and injustices arise. An alternative definition is proposed which is shown to avoid these difficulties. It is also shown that and how on the new definition the alleged Liar paradox is easily dissolved.     

The Elimination of Self-Reference: Generalized Yablo-Series and the Theory of Truth

Although it was traditionally thought that self-reference is a crucial ingredient of semantic paradoxes, Yablo (1993, 2004) showed that this was not so by displaying an infinite series of sentences none of which is self-referential but which, taken together, are paradoxical. Yablo’s paradox consists of a countable series of linearly ordered sentences s(0), s(1), s(2),... , where each s(i) says: For each k > i, s(k) is false (or equivalently: For no k > i is s(k) true). We generalize Yablo’s results along two dimensions. First, we study the behavior of generalized Yablo-series in which each sentence s(i) has the form: For Q k > i, s(k) is true, where Q is a generalized quantifier (e.g., no, every, infinitely many, etc). We show that under broad conditions all the sentences in the series must have the same truth value, and we derive a characterization of those values of Q for which the series is paradoxical. Second, we show that in the Strong Kleene trivalent logic Yablo’s results are a special case of a more general fact: under certain conditions, any semantic phenomenon that involves self-reference can be emulated without self-reference. Various translation procedures that eliminate self-reference from a non-quantificational language are defined and characterized. An Appendix sketches an extension to quantificational languages, as well as a new argument that Yablo’s paradox and the translations we offer do not involve self-reference.     

Saving the Truth Schema from Paradox

The paper shows how we can add a truth predicate to arithmetic (or formalized syntactic theory), and keep the usual truth schema Tr(A)A (understood as the conjunction of Tr(A)A and ATr(A)). We also keep the full intersubstitutivity of Tr(A)) with A in all contexts, even inside of an . Keeping these things requires a weakening of classical logic; I suggest a logic based on the strong Kleene truth tables, but with 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 ; 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.     

On Meaningfulness and Truth

We show how to construct certain L _{M, T} -type interpreted languages, with each such language containing meaningfulness and truth predicates which apply to itself. These languages are comparable in expressive power to the L _T -type, truth-theoretic languages first considered by Kripke, yet each of our L _{M, T} -type languages possesses the additional advantage that, within it, the meaninglessness of any given meaningless expression can itself be meaningfully expressed. One therefore has, for example, the object level truth (and meaningfulness) of the claim that the strengthened Liar is meaningless.     

Stability and Paradox in Algorithmic Logic

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally.     

说谎者悖论及其相关悖论的一种解决

依本文之见,说谎者悖论以及某些与之相关的悖论之被导出源于对某些不合理的前提的接受;而这些前提之被接受又源于对＂是真的＂与＂是假的＂这两个词的关键语义特性缺乏认识。本文为决定这些语义特性的基础提供了说明;这一基础包含两个论点,第一,每一语句均有其含义;第二,每一语句陈说的字面内容是一个命题态度的内容,因而具有某种一般形式。借助于这一基础,本文为这两个词构造了一个不同于传统意义上的塔尔斯基式真理理论的意义理论以说明这些特性,并借助于该理论论证说谎者悖论及其某些相关悖论的导出没有根据。     

Modal Logic,Truth, and the Master Modality

In the paper (Braüner, 2001) we gave a minimal condition for the existence of a homophonic theory of truth for a modal or tense logic. In the present paper we generalise this result to arbitrary modal logics and we also show that a modal logic permits the existence of a homophonic theory of truth if and only if it permits the definition of a so-called master modality. Moreover, we explore a connection between the master modality and hybrid logic: We show that if attention is restricted to bidirectional frames, then the expressive power of the master modality is exactly what is needed to translate the bounded fragment of first-order logic into hybrid logic in a truth preserving way. We believe that this throws new light on Arthur Prior's fourth grade tense logic.     

A Propositional Logic with Relative Identity Connective and a Partial Solution to the Paradox of Analysis

We construct a a system PLRI which is the classical propositional logic supplied with a ternary construction , interpreted as the intensional identity of statements and in the context . PLRI is a refinement of Roman Suszko’s sentential calculus with identity (SCI) whose identity connective is a binary one. We provide a Hilbert-style axiomatization of this logic and prove its soundness and completeness with respect to some algebraic models. We also show that PLRI can be used to give a partial solution to the paradox of analysis. Presented by Jacek Malinowski     

Replies to Bacon,Eklund, and Greenough on Replacing Truth

Andrew Bacon, Matti Eklund, and Patrick Greenough have individually proposed objections to the project in my book, Replacing Truth. Briefly, the book outlines a conceptual engineering project – our defective concept of truth is replaced for certain purposes with a team of concepts that can do some of the jobs we thought truth could do. Here, I respond to their objections and develop the views expressed in Replacing Truth in various ways.     

Henkin Quantifiers and the Definability of Truth

Henkin quantifiers have been introduced in Henkin (1961). Walkoe (1970) studied basic model-theoretical properties of an extension L _* ¹(H) of ordinary first-order languages in which every sentence is a first-order sentence prefixed with a Henkin quantifier. In this paper we consider a generalization of Walkoe's languages: we close L _* ¹(H) with respect to Boolean operations, and obtain the language L ¹(H). At the next level, we consider an extension L _* ²(H) of L ¹(H) in which every sentence is an L ¹(H)-sentence prefixed with a Henkin quantifier. We repeat this construction to infinity. Using the (un)-definability of truth – in – N for these languages, we show that this hierarchy does not collapse. In addition, we compare some of the present results to the ones obtained by Kripke (1975), McGee (1991), and Hintikka (1996).     

Truthlikeness and the Lottery Paradox via the Preface Paradox

In a 2017 AJP paper, Cevolani and Schurz (C&S) propose a novel solution to the Preface Paradox that appeals to the notion of expected truthlikeness. This discussion note extends and analyses their approach by applying it to the related Lottery Paradox.     

The Liar Paradox and the Inclosure Schema

In Beyond the Limits of Thought [2002], Graham Priest argues that logical and semantic paradoxes have the same underlying structure (which he calls the Inclosure Schema). He also argues that, in conjunction with the Principle of Uniform Solution (same kind of paradox, same kind of solution), this is sufficient to ‘sink virtually all orthodox solutions to the paradoxes’, because the orthodox solutions to the paradoxes are not uniform. I argue that Priest fails to provide a non-question-begging method to ‘sink virtually all orthodox solutions’, and that the Inclosure Schema cannot be the structure that underlies the Liar paradox. Moreover, Ramsey was right in thinking that logical and semantic paradoxes are paradoxes of different kinds.     

Equivalents of Mingle and Positive Paradox

Relevant logic is a proper subset of classical logic. It does not include among its theorems any ofpositive paradox A (B A)mingle A (A A)linear order (A B) (B A)unrelated extremes (A ) (B B¯)This article shows that those four formulas have different effects when added to relevant logic, and then lists many formulas that have the same effect as positive paradox or mingle.