What requirements must deflationary formal theories of truth satisfy? This chapter argues against the widely accepted view that compositional and Tarskian theories of truth are substantial or otherwise unacceptable to deflationists. First, two purposes that a formal truth theory can serve are distinguished: one descriptive, the other logical (i.e., to characterise the correctness of inferences involving ‘true’). The chapter argues that the most compelling arguments for the incompatibility of compositional and Tarskian theories concern descriptive theories only. -/- Second, two requirements (...) that any deflationist truth theory intended to serve a logical purpose must satisfy are put forward. These requirements, it is argued, suggest that (i) many well-known compositional and Tarskian theories are acceptable from a deflationist standpoint (including CT); (ii) certain other popular theories of truth (including KF and FS) are not similarly acceptable; (iii) there are no conclusive reasons to impose a conservativeness requirement on deflationary theories of truth. (shrink)

The aim of this paper is to provide a minimalist axiomatic theory of truth based on the notion of reference. To do this, we first give sound and arithmetically simple notions of reference, self-reference, and well-foundedness for the language of first-order arithmetic extended with a truth predicate; a task that has been so far elusive in the literature. Then, we use the new notions to restrict the T-schema to sentences that exhibit "safe" reference patterns, confirming the widely accepted but never (...) worked out idea that paradoxes can be characterised in terms of their underlying reference patterns. This results in a strong, ω-consistent, and well-motivated system of disquotational truth, as required by minimalism. (shrink)

Our relationship to the infinite is controversial. But it is widely agreed that our powers of reasoning are finite. I disagree with this consensus; I think that we can, and perhaps do, engage in infinite reasoning. Many think it is just obvious that we can't reason infinitely. This is mistaken. Infinite reasoning does not require constructing infinitely long proofs, nor would it gift us with non-recursive mental powers. To reason infinitely we only need an ability to perform infinite inferences. I (...) argue that we have this ability. My argument looks to our best current theories of inference and considers examples of apparent infinite reasoning. My position is controversial, but if I'm right, our theories of truth, mathematics, and beyond could be transformed. And even if I'm wrong, a more careful consideration of infinite reasoning can only deepen our understanding of thinking and reasoning. -/- (Note for readers: the paper's brief discussion of uniform reflection and omega inconsistency is misleading. The imagined interlocutor's argument makes an assumption about the PA-provability of provability generalizations that, while true for the Godel sentence's instances, is unjustified, in general. This means my position is stronger against this objection than the paper suggests, since omega inconsistent theories are not automatically inconsistent with their uniform reflection principles, you also need to assume the arithmetically true Pi-2 sentences.). (shrink)

Horwich proposes a solution to the liar paradox that relies on a particular notion of grounding—one that, unlike Kripke’s notion of grounding, does not invoke any “Tarski-style compositional principles”. In this short note, we will formalize Horwich’s construction and argue that his solution to the liar paradox does not justify certain generalizations about truth that he endorses. We argue that this situation is not resolved even if one appeals to the \-rule. In the final section, we briefly discuss how Horwich (...) might respond to the situation. (shrink)

T-biconditionals have often been regarded as insufficient as axioms for truth. This verdict is based on Tarski’s observation that the typed T-sentences suffer from deductive weakness. As indicated by McGee, the situation might change radically if we consider type-free disquotational theories of truth. However, finding a well-motivated set of untyped T-biconditionals that is consistent and recursively enumerable has proven to be very difficult. Moreover, some authors ) have argued that any solution to the semantic paradoxes necessarily involves ‘inflationary’ means, thus (...) spelling doom to deflationist and minimalist truth theories in particular. The situation is indeed worrisome as formal theories of minimalist truth are missing so far. This makes it very hard to properly evaluate the tenets of minimalism. In the present article, we will show how to find safe instances of the T-schema just by relying on syntactic features of the sentences of our language—in particular, we will explore Quine’s idea of stratification. Based on that, we will introduce some disquotational truth theories that are deductively very strong. (shrink)

Non‐classical logicians do not typically reject classically valid logical principles across the board. In fact, they sometimes suggest that their preferred logic recovers classical reasoning in most circumstances. This idea has come to be known in the literature as ‘classical recapture’. Recently, classical logicians have raised various doubts about it. The main problem is said to be that no rigorous explanation has been given of how is it exactly that classical logic can be recovered. The goal of the paper is (...) to address this problem. First, I discuss a number of different ways to characterize the idea of classical recapture and I examine how far it can be pushed. Secondly, I argue that a palatable form of classical recapture is given by the thought that classical logic can be retained for statements that are grounded (in Kripke’s sense). To substantiate this view I provide a formal fixed‐point semantics for a language containing a predicate standing for the concept of groundedness and I address a couple of objections that have been deployed against the claim that classical recapture can aid the non‐classical logician’s cause. (shrink)

Semantic paradoxes like the liar are notorious challenges to truth theories. A paradox can be phrased with minimal resources and minimal assumptions. It is not surprising, then, that the liar is also a challenge to minimalism about truth. Horwich (1990) deals swiftly with the paradox, after discriminating between other strategies for avoiding it without compromising minimalism. He dismisses the denial of classical logic, the denial that the concept of truth can coherently be applied to propositions, and the denial that the (...) liar sentence expresses a proposition, but he endorses the denial that the liar is an acceptable instance of the equivalence schema (E). This paper has two main parts. It first shows that Horwich’s preferred denial is also problematic. As Simmons (1999), Beall and Armour-Garb (2003), and Asay (2015) argued, the solution is ad hoc, faces a possible loss of expressibility, and is ultimately unstable. Finally, the paper explores a different combination of possibilities for minimalism: treating the truth-predicate as context-dependent, rejecting the notion that the liar expresses a proposition, and reinterpreting negation in some contexts as metalinguistic denial. The paper argues that these are preferable options, but signposts possible dangers ahead. (shrink)

A popular and enduring approach to the liar paradox takes the concept of truth to be inconsistent. Very roughly, truth is an inconsistent concept if the central principles of this concept (taken together) entail a contradiction, where one of these central principles is Tarski's T-schema for truth: a sentence S is true if and only if p, (where S says that p). This article targets a version of Inconsistentism which: retains classical logic and bivalence; takes the truth-predicate “is true” to (...) pick out a property (and determine a non-empty extension relative to a given world); and holds that liar sentences exhibit a certain kind of indeterminacy in truth-value. Call such a view Modest Inconsistentism since it is somewhat more conservative in its outlook than various other forms of Inconsistentism. Such a modest view has its attractions: we retain the thesis that the liar sentence is meaningful; we get to respect the claims that there are truths and that there is a property of truth; we get to keep classical logic and bivalence; and, prima facie, no strengthened liar paradox is in the offing. The main aim in this paper is to show that Modest Inconsistentism, despite its initial attractions, is in deep trouble—because it does, after all, give rise to a strengthened liar paradox. We shall also see that there are related kinds of theory which are also subject to the same worry. (shrink)

Vann McGee has argued against solutions to the liar paradox that simply restrict the scope of the T sentences as little as possible. This argument is often taken to disprove Paul Horwich’s preferred solution to the liar paradox for his Minimal Theory of truth. I argue that Horwich’s theory is different enough from the theory McGee criticized that these criticisms do not apply to Horwich’s theory. On the basis of this, I argue that propositional theories, like MT, cannot be evaluated (...) using the same methods as sentential theories. (shrink)

One well known approach to the soritical paradoxes is epistemicism, the view that propositions involving vague notions have definite truth values, though it is impossible in principle to know what they are. Recently, Paul Horwich has extended this approach to the liar paradox, arguing that the liar proposition has a truth value, though it is impossible to know which one it is. The main virtue of the epistemicist approach is that it need not reject classical logic, and in particular the (...) unrestricted acceptance of the principle of bivalence and law of excluded middle. Regardless of its success in solving the soritical paradoxes, the epistemicist approach faces a number of independent objections when it is applied to the liar paradox. I argue that the approach does not offer a satisfying, stable response to the paradoxes—not in general, and not for a minimalist about truth like Horwich. (shrink)

Tarski’s pioneering work on truth has been thought by some to motivate a robust, correspondence-style theory of truth, and by others to motivate a deflationary attitude toward truth. I argue that Tarski’s work suggests neither; if it motivates any contemporary theory of truth, it motivates conceptual primitivism, the view that truth is a fundamental, indefinable concept. After outlining conceptual primitivism and Tarski’s theory of truth, I show how the two approaches to truth share much in common. While Tarski does not (...) explicitly accept primitivism, the view is open to him, and fits better with his formal work on truth than do correspondence or deflationary theories. Primitivists, in turn, may rely on Tarski’s insights in motivating their own perspective on truth. I conclude by showing how viewing Tarski through the primitivist lens provides a fresh response to some familiar charges from Putnam and Etchemendy. (shrink)

This book is a contribution to the flourishing field of formal and philosophical work on truth and the semantic paradoxes. Our aim is to present several theories of truth, to investigate some of their model-theoretic, recursion-theoretic and proof-theoretic aspects, and to evaluate their philosophical significance. In Part I we first outline some motivations for studying formal theories of truth, fix some terminology, provide some background on Tarski’s and Kripke’s theories of truth, and then discuss the prospects of classical type-free truth. (...) In Chapter 4 we discuss some minimal adequacy conditions on a satisfactory theory of truth based on the function that the truth predicate is intended to fulfil on the deflationist account. We cast doubt on the adequacy of some non-classical theories of truth and argue in favor of classical theories of truth. Part II is devoted to grounded truth. In chapter 5 we introduce a game-theoretic semantics for Kripke’s theory of truth. Strategies in these games can be interpreted as reference-graphs of the sentences in question. Using that framework, we give a graph-theoretic analysis of the Kripke-paradoxical sentences. In chapter 6 we provide simultaneous axiomatizations of groundedness and truth, and analyze the proof-theoretic strength of the resulting theories. These range from conservative extensions of Peano arithmetic to theories that have the full strength of the impredicative system ID1. Part III investigates the relationship between truth and set-theoretic comprehen- sion. In chapter 7 we canonically associate extensions of the truth predicate with Henkin-models of second-order arithmetic. This relationship will be employed to determine the recursion-theoretic complexity of several theories of grounded truth and to show the consistency of the latter with principles of generalized induction. In chapter 8 it is shown that the sets definable over the standard model of the Tarskian hierarchy are exactly the hyperarithmetical sets. Finally, we try to apply a certain solution to the set-theoretic paradoxes to the case of truth, namely Quine’s idea of stratification. This will yield classical disquotational theories that interpret full second-order arithmetic without set parameters, Z2- . We also indicate a method to recover the parameters. An appendix provides some background on ordinal notations, recursion theory and graph theory. (shrink)