The Paradox of the Knower was originally presented by Kaplan and Montague [26] as a puzzle about the everyday notion of knowledge in the face of self-reference. The paradox shows that any theory extending Robinson arithmetic with a predicate K satisfying the factivity axiom K → A as well as a few other epistemically plausible principles is inconsistent. After surveying the background of the paradox, we will focus on a recent debate about the role of epistemic closure principles in the (...) Knower. We will suggest this debate sheds new light on the concept of knowledge which is at issue in the paradox – i.e. is it a “thin” notion divorced from concepts such as evidence or justification, or is it a “thick” notion more closely resembling mathematical provability? We will argue that a number of features of the paradox suggest that the latter option is more plausible. Along the way, we will provide a reconstruction of the paradox using a quantified extension of Artemovʼs [2] Logic of Proofs, as well as a series of results linking the original formulation of the paradox to reflection principles for formal arithmetic. On this basis, we will argue that while the Knower can be understood to motivate a distinction between levels of knowledge, it does not provide a rationale for recognizing a uniform hierarchy of knowledge predicates in the manner suggested by Anderson. (shrink)

Although there has been a recent swell of interest in theories of truth that attempt solutions to the liar paradox and the other paradoxes affecting our concept of truth, many of these theories have been criticized for generating new paradoxes, called revenge paradoxes. The criticism is that the theories of truth in question are inadequate because they only work for languages lacking in the resources to generate revenge paradoxes. Theorists facing these objections offer a range of replies, and the matter (...) seems now to be at a standoff. I aim, first, to bolster the revenge objections by considering a relation, internalizability, between languages and theories of truth. A theory of truth is internalizable for a language iff there is an extension of that language in which the theory is expressible and for which the theory provides an accurate and complete assignment of semantic values. There are good reasons to think that acceptable theories of truth are internalizable for any language. With this internalizability requirement in hand, I argue that properly formulated revenge objections are decisive and that the replies to them are inadequate. Second, I show that the internalizability requirement can be met by a certain theory of truth. The central claim of this theory is that truth is an inconsistent concept and should be replaced with a pair of consistent concepts that can then be used to provide a semantics for our truth predicates. This theory is compatible with classical logic, does not give rise to revenge paradoxes of any kind, and satisfies the internalizability requirement. (shrink)

This paper explores the interface between principles of self-applicable truth and classical logic. To this end, the proof-theoretic strength of a number of axiomatic theories of truth over intuitionistic logic is determined. The theories considered correspond to the maximal consistent collections of fifteen truth-theoretic principles as isolated in Leigh and Rathjen.

We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.

This article explores ways in which the Revision Theory of Truth can be expressed in the object language. In particular, we investigate the extent to which semantic deficiency, stable truth, and nearly stable truth can be so expressed, and we study different axiomatic systems for the Revision Theory of Truth.

Hannes Leitgeb formulated eight norms for theories of truth in his paper [5]: `What Theories of Truth Should be Like (but Cannot be)'. We shall present in this paper a theory of truth for suitably constructed languages which contain the first-order language of set theory, and prove that it satisfies all those norms.

Logicians interested in naive theories of truth or set have proposed logical frameworks in which classical operational rules are retained but structural rules are restricted. One increasingly popular way to do this is by restricting transitivity of entailment. This paper discusses a series of logics in this tradition, in which the transitivity restrictions are effected by a determinacy constraint on assumptions occurring in both the major and minor premises of certain rules. Semantics and proof theory for 3-valued, continuum-valued and surreal-valued (...) semantics are given and the proof theory for the systems outlined. The framework is robust in the sense that no conditional, defined or primitive, which sustains the contraction principles underlying Curry paradoxes can be expressed. Classical recapture is smoothly achievable in the system which however is expressively limited and not semantically closed. The conclusion considers the issue of how to extend the system to capture full naive set theory. (shrink)

In the fifth of his John Locke Lectures, Robert Brandom takes up the challenge to define a formal semantics for modelling conceptual contents according to his normative analysis of linguistic practices. The project is to exploit the notion of incompatibility in order to directly define a modally robust relation of entailment. Unfortunately, it can be proved that, in the original definition, the modal system represented by Incompatibility Semantics (IS) collapses into propositional calculus. In this paper I show how IS can (...) be technically amended so to overcome this failure: the required modifications are already known and consist in adapting and including the main notions of Kripke's standard framework of possible worlds. I also show that the modifications do not jeopardize Brandom's original project. (shrink)

This paper presents and defends a way to add a transparent truth predicate to classical logic, such that and A are everywhere intersubstitutable, where all T-biconditionals hold, and where truth can be made compositional. A key feature of our framework, called STTT (for Strict-Tolerant Transparent Truth), is that it supports a non-transitive relation of consequence. At the same time, it can be seen that the only failures of transitivity STTT allows for arise in paradoxical cases.

We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for which a player has a winning strategy in an infinite two person game. The classifications of the games considered here are simple, those over the natural model of arithmetic being all within the arithmetical class of $\Sum_{3}^{0}$.

The present paper suggests relative truth definability as a tool for comparing conceptual aspects of axiomatic theories of truth and gives an overview of recent developments of axiomatic theories of truth in the light of it. We also show several new proof-theoretic results via relative truth definability including a complete answer to the conjecture raised by Feferman in [13].

Disquotational theories of truth, that is, theories of truth based on the T-sentences or similar equivalences as axioms are often thought to be deductively weak. This view is correct if the truth predicate is allowed to apply only to sentences not containing the truth predicate. By taking a slightly more liberal approach toward the paradoxes, I obtain a disquotational theory of truth that is proof theoretically as strong as compositional theories such as the Kripket probe the compositional axioms.

In this article, the prospects of deflationism about the concept of truth are investigated. A new version of deflationism, called inferential deflationism, is articulated and defended. It is argued that it avoids the pitfalls of earlier deflationist views such as Horwich’s minimalist theory of truth and Field’s version of deflationism.

What is the simplest and most natural axiomatic replacement for the set-theoretic definition of the minimal fixed point on the Kleene scheme in Kripke’s theory of truth? What is the simplest and most natural set of axioms and rules for truth whose adoption by a subject who had never heard the word "true" before would give that subject an understanding of truth for which the minimal fixed point on the Kleene scheme would be a good model? Several axiomatic systems, old (...) and new, are examined and evaluated as candidate answers to these questions, with results of Harvey Friedman playing a significant role in the examination. (shrink)

According to the received view, formalism – interpreted as the thesis that mathematical truth does not outrun the consequences of our maximal mathematical theory – has been refuted by Goedel's theorem. In support of this claim, proponents of the received view usually invoke an informal argument for the truth of the Goedel sentence, an argument which is supposed to reconstruct our reasoning in seeing its truth. Against this, Field has argued in a series of papers that the principles involved in (...) this argument – when applied to our maximal mathematical theory – are unsound. This paper defends the received view by showing that there is a way of seeing the truth of the Goedel sentence which is immune to Field's strategy. (shrink)

elaboration of the last part of my Tarski Lecture, “Truth unbound”, UC Berkeley, 3 April 2006, and of the lecture, “A nicer formal theory of non-hierarchical truth”, Workshop on Mathematical Methods in Philosophy, Banff , 18-23 Feb. 2007.

This article outlines what a formal theory of truth should be like, at least at first glance. As not all of the stated constraints can be satisfied at the same time, in view of notorious semantic paradoxes such as the Liar paradox, we consider the maximal consistent combinations of these desiderata and compare their relative advantages and disadvantages.

We present a revenge argument for non-reflexive theories of semantic notions – theories which restrict the rule of assumption, or initial sequents of the form φ ⊩ φ. Our strategy follows the general template articulated in Murzi and Rossi [21]: we proceed via the definition of a notion of paradoxicality for non-reflexive theories which in turn breeds paradoxes that standard non-reflexive theories are unable to block.

This paper concerns the relationship between transitivity of entailment, omega-inconsistency and nonstandard models of arithmetic. First, it provides a cut-free sequent calculus for non-transitive logic of truth STT based on Robinson Arithmetic and shows that this logic is omega-inconsistent. It then identifies the conditions in McGee for an omega-inconsistent logic as quantified standard deontic logic, presents a cut-free labelled sequent calculus for quantified standard deontic logic based on Robinson Arithmetic where the deontic modality is treated as a predicate, proves omega-inconsistency (...) and shows thus, pace Cobreros et al., that the result in McGee does not rely on transitivity. Finally, it also explains why the omega-inconsistent logics of truth in question do not require nonstandard models of arithmetic. (shrink)

Against the backdrop of the frequent comparison of theories of truth in the literature on semantic paradoxes with regard to which inferences and metainferences are deemed valid, this paper develops a novel approach to defining a binary predicate for representing the valid inferences and metainferences of a theory within the theory itself under the assumption that the theory is defined with a classical meta-theory. The aim with the approach is to obtain a tool which facilitates the comparison between a theory (...) and its competitors within the theory itself, thereby expressing the disagreement between the theories within the theories. After discussing what we can and should require of an object-linguistic representation of a theory for that purpose, this paper proposes to restrict the representation of valid metainferences to locally valid metainferences, a requirement which turns out to be \-consistent and conservative over classical first-order arithmetic. This approach is then applied to four theories definable on strong Kleene models using a labelled nested sequent calculus. (shrink)

In “Some Remarks on Extending and Interpreting Theories with a Partial Truth Predicate”, Reinhardt [21] famously proposed an instrumentalist interpretation of the truth theory Kripke–Feferman ( $\mathrm {KF}$ ) in analogy to Hilbert’s program. Reinhardt suggested to view $\mathrm {KF}$ as a tool for generating “the significant part of $\mathrm {KF}$ ”, that is, as a tool for deriving sentences of the form $\mathrm{Tr}\ulcorner {\varphi }\urcorner $. The constitutive question of Reinhardt’s program was whether it was possible “to justify the (...) use of nonsignificant sentences entirely within the framework of significant sentences”. This question was answered negatively by Halbach & Horsten [10] but we argue that under a more careful interpretation the question may receive a positive answer. To this end, we propose to shift attention from $\mathrm {KF}$ -provably true sentences to $\mathrm {KF}$ -provably true inferences, that is, we shall identify the significant part of $\mathrm {KF}$ with the set of pairs $\langle {\Gamma, \Delta }\rangle $, such that $\mathrm {KF}$ proves that if all members of $\Gamma $ are true, at least one member of $\Delta $ is true. In way of addressing Reinhardt’s question we show that the provably true inferences of suitable $\mathrm {KF}$ -like theories coincide with the provable sequents of matching versions of the theory Partial Kripke–Feferman ( $\mathrm {PKF}$ ). (shrink)

A natural suggestion and increasingly popular account of how to revise our logical beliefs treats revision of logic analogously to the revision of scientific theories. I investigate this approach and argue that simple applications of abductive methodology to logic result in revision-cycles, developing a detailed case study of an actual dispute with this property. This is problematic if we take abductive methodology to provide justification for revising our logical framework. I then generalize the case study, pointing to similarities with more (...) recent and popular heterodox logics such as naïve logics of truth. I use this discussion to motivate a constraint—logical partisanhood—on the uses of such methodology: roughly: both the proposed alternative and our actual background logic must be able to agree that moving to the alternative logic is no worse than staying put. (shrink)

Many advocates of non-classical logic for reasons external to mathematics claim that their proposed revisions are consistent with the use of classical logic within pure mathematics. Doubts are raised about such claims, concerning the applicability of pure mathematics to natural and social science. -/- .

Justified belief is a core concept in epistemology and there has been an increasing interest in its logic over the last years. While many logical investigations consider justified belief as an operator, in this paper, we propose a logic for justified belief in which the relevant notion is treated as a predicate instead. Although this gives rise to the possibility of liar-like paradoxes, a predicate treatment allows for a rich and highly expressive framework, which lives up to the universal ambitions (...) of investigating epistemological concepts. We start with a base theory for justified belief, and then systematically present putative additional axioms for justified belief. We provide an overview of consistency results when the additional principles are added to the base theory, and discuss their philosophical plausibility. (shrink)

Bruno Whittle (2019) has recently extended Kripke’s semantical theory of truth to languages containing generalized quantifiers. There are reasons for axiomatizing semantical theories, and for regarding Halbach and Horsten’s PKF as a good axiomatization of Kripke’s. PKF is a theory in Partial Logic. The present paper complements Whittle’s by showing how Partial Logic, and then PKF, may be extended to cover binary quantifiers meaning ‘every’, ‘some’, and ‘most’.

It is part of the current wisdom that the Liar and similar semantic paradoxes can be taken care of by the use of certain non-classical multivalued logics. In this paper I want to suggest that bivalent logic can do just as well. This is accomplished by using a non-deterministic matrix to define the negation connective. I show that the systems obtained in this way support a transparent truth predicate. The paper also contains some remarks on the conceptual interest of such (...) systems. (shrink)

Revenge arguments purport to show that any proposed solution to the semantic paradoxes generates new paradoxes that prove that solution to be inadequate. In this paper, I focus on revenge arguments that employ the model-theoretic semantics of a target theory and I argue, contra the current revenge-theoretic wisdom, that they can constitute genuine expressive limitations. I consider the anti-revenge strategy elaborated by Field and argue that it does not offer a way out of the revenge problem. More generally, I argue (...) that the difference between ‘standard’ and ‘revenge’ paradoxes is ill-conceived and should be abandoned. This will contribute to show that the theories that provide a uniform account of truth and other semantic notions are the ones best equipped to avoid the paradoxes altogether—‘standard’ and ‘revenge’ alike. (shrink)

Can one quantify over absolutely everything? Absolutists answer positively, while relativists answer negatively. Here, I focus on the absolutism versus relativism debate in the framework of theories of truth, where relativism becomes a form of contextualism about truth predications. Contextualist theories of truth provide elegant and uniform solutions to the semantic paradoxes while preserving classical logic. However, they interpret harmless generalizations (such as “everything is self-identical”) in less than absolutely comprehensive domains, thus systematically misconstruing them. In this article, I show (...) that contextualism is broadly compatible with absolute generality. More specifically, I develop a bipartite contextualist semantics, or “bicontextualism,” on which sentences are split in two groups: the unproblematic sentences, which are compatible with absolute generality, and the problematic ones, which are given a relativist semantics. I then argue that bicontextualism retains the advantages of (orthodox) contextualism and does not give rise to new revenge paradoxes. (shrink)

The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language. In this paper, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a (...) unified account of paradoxical sentences. The theory I propose here yields a threefold classification of paradoxical sentences – liar-like sentences, truth-teller-like sentences, and revenge sentences. Unlike existing treatments of semantic paradox, the theory put forward in this paper yields a way of interpreting all three kinds of paradoxical sentences, as well as unparadoxical sentences, within a single model. (shrink)

Kripke’s theory of truth, 690–716; 1975) has been very successful but shows well-known expressive difficulties; recently, Field has proposed to overcome them by adding a new conditional connective to it. In Field’s theories, desirable conditional and truth-theoretic principles are validated that Kripke’s theory does not yield. Some authors, however, are dissatisfied with certain aspects of Field’s theories, in particular the high complexity. I analyze Field’s models and pin down some reasons for discontent with them, focusing on the meaning of the (...) new conditional and on the status of the principles so successfully recovered. Subsequently, I develop a semantics that improves on Kripke’s theory following Field’s program of adding a conditional to it, using some inductive constructions that include Kripke’s one and feature a strong evaluation for conditionals. The new theory overcomes several problems of Kripke’s one and, although weaker than Field’s proposals, it avoids the difficulties that affect them; at the same time, the new theory turns out to be quite simple. Moreover, the new construction can be used to model various conceptions of what a conditional connective is, in ways that are precluded to both Kripke’s and Field’s theories. (shrink)

In Heck, Richard Heck presents variants on the familiar liar paradox, intended to reveal limitations of theories of transparent truth. But all existing theories of transparent truth can respond to Heck's variants in just the same way they respond to the liar. These new variants thus put no new pressure on theories of transparent truth.

The recent development and exploration of mixed metainferential logics is a breakthrough in our understanding of nontransitive and nonreflexive logics. Moreover, this exploration poses a new challenge to theorists like me, who have appealed to similarities to classical logic in defending the logic ST, since some mixed metainferential logics seem to bear even more similarities to classical logic than ST does. There is a whole ST-based hierarchy, of which ST itself is only the first step, that seems to become more (...) and more classical at each level. I think this seeming is misleading: for certain purposes, anyhow, metainferential hierarchies give us no reason to move on from ST. ST is indeed only the first step on a grand metainferential adventure; but one step is enough. This paper aims to explain and defend that claim. Along the way, I take the opportunity also to develop some formal tools and results for thinking about metainferential logics more generally. (shrink)

The recent development and exploration of mixed metainferential logics is a breakthrough in our understanding of nontransitive and nonreflexive logics. Moreover, this exploration poses a new challenge to theorists like me, who have appealed to similarities to classical logic in defending the logic ST, since some mixed metainferential logics seem to bear even more similarities to classical logic than ST does. There is a whole ST-based hierarchy, of which ST itself is only the first step, that seems to become more (...) and more classical at each level. I think this seeming is misleading: for certain purposes, anyhow, metainferential hierarchies give us no reason to move on from ST. ST is indeed only the first step on a grand metainferential adventure; but one step is enough. This paper aims to explain and defend that claim. Along the way, I take the opportunity also to develop some formal tools and results for thinking about metainferential logics more generally. (shrink)

Weakening classical logic is one of the most popular ways of dealing with semantic paradoxes. Their advocates often claim that such weakening does not affect non-semantic reasoning. Recently, however, Halbach and Horsten have shown that this is actually not the case for Kripke’s fixed-point theory based on the Strong Kleene evaluation scheme. Feferman’s axiomatization $\textsf{KF}$ in classical logic is much stronger than its paracomplete counterpart $\textsf{PKF}$, not only in terms of semantic but also in arithmetical content. This paper compares the (...) proof-theoretic strength of an axiomatization of Kripke’s construction based on the paraconsistent evaluation scheme of $\textsf{LP}$, formulated in classical logic with that of an axiomatization directly formulated in $\textsf{LP}$, extended with a consistency operator. The ultimate goal is to find out whether paraconsistent solutions to the paradoxes that employ consistency operators fare better in this respect than paracomplete ones. (shrink)

I apply the notions of alethic reference introduced in previous work in the construction of several classical semantic truth theories. Furthermore, I provide proof-theoretic versions of those notions and use them to formulate axiomatic disquotational truth systems over classical logic. Some of these systems are shown to be sound, proof-theoretically strong, and compare well to the most renowned systems in the literature.

As a response to the semantic and logical paradoxes, theorists often reject some principles of classical logic. However, classical logic is entangled with mathematics, and giving up mathematics is too high a price to pay, even for nonclassical theorists. The so-called recapture theorems come to the rescue. When reasoning with concepts such as truth/class membership/property instantiation, (These are examples of concepts that are taken to satisfy naive rules such as the naive truth schema and naive comprehension, and that therefore are (...) compatible with a solution to paradox cast in the logics considered below. Other notions of similar kind can be added to the list.) if one is interested in consequences of the theory that only contain mathematical vocabulary, nothing is lost by reasoning in the nonclassical framework. This article shows that this claim is highly misleading, if not simply false. Under natural assumptions, some well-established approaches to recapture are incorrect. (shrink)

Substructural logics and their application to logical and semantic paradoxes have been extensively studied. In the paper, we study theories of naïve consequence and truth based on a non-reflexive logic. We start by investigating the semantics and the proof-theory of a system based on schematic rules for object-linguistic consequence. We then develop a fully compositional theory of truth and consequence in our non-reflexive framework.

We study the relationships between two clusters of axiomatizations of Kripke’s fixed-point models for languages containing a self-applicable truth predicate. The first cluster is represented by what we will call ‘\-like’ theories, originating in recent work by Halbach and Horsten, whose axioms and rules are all valid in fixed-point models; the second by ‘\-like’ theories first introduced by Solomon Feferman, that lose this property but reflect the classicality of the metatheory in which Kripke’s construction is carried out. We show that (...) to any natural system in one cluster—corresponding to natural variations on induction schemata—there is a corresponding system in the other proving the same sentences true, addressing a problem left open by Halbach and Horsten and accomplishing a suitably modified version of the project sketched by Reinhardt aiming at an instrumental reading of classical theories of self-applicable truth. (shrink)

When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving two well-known variants of Kripke–Feferman truth. The first, \, features a consistent but partial truth predicate. The second, \, an inconsistent but complete truth predicate. It is known that the two truth predicates are dual to each other. We show that this duality reveals a much stricter correspondence between the two theories: they are intertraslatable. Intertranslatability, under natural assumptions, coincides with (...) definitional equivalence, and is arguably the strictest notion of theoretical equivalence different from logical equivalence. The case of \ and \ raises a puzzle: the two theories can be proved to be strictly related, yet they appear to embody remarkably different conceptions of truth. We discuss the significance of the result for the broader debate on formal criteria of conceptual reducibility for theories of truth. (shrink)

Beall and Murzi :143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules. As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field :1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this paper (...) is to respond to Field’s objections and to point to a coherent notion of validity which underwrites a coherent reading of Beall and Murzi’s principles: grounded validity. The notion, first introduced by Nicolai and Rossi, is a generalisation of Kripke’s notion of grounded truth, and yields an irreflexive logic. While we do not advocate the adoption of a substructural logic, we take the notion of naïve validity to be a legitimate semantic notion that points to genuine expressive limitations of fully structural revisionary approaches. (shrink)

Since Saul Kripke’s influential work in the 1970s, the revisionary approach to semantic paradox—the idea that semantic paradoxes must be solved by weakening classical logic—has been increasingly popular. In this paper, we present a new revenge argument to the effect that the main revisionary approaches breed new paradoxes that they are unable to block.

This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...) predicate logic of the system. The propositional logic of HYPE is shown to contain first-degree entailment, to have the Finite Model Property, to be decidable, to have the Disjunction Property, and to extend intuitionistic propositional logic conservatively when intuitionistic negation is defined appropriately by HYPE’s logical connectives. Furthermore, HYPE’s first-order logic is a conservative extension of intuitionistic logic with the Constant Domain Axiom, when intuitionistic negation is again defined appropriately. The system allows for simple model constructions and intuitive Euler-Venn-like diagrams, and its logical structure matches structures well-known from ordinary mathematics, such as from optimization theory, combinatorics, and graph theory. HYPE may also be used as a general logical framework in which different systems of logic can be studied, compared, and combined. In particular, HYPE is found to relate in interesting ways to classical logic and various systems of relevance and paraconsistent logic, many-valued logic, and truthmaker semantics. On the philosophical side, if used as a logic for theories of type-free truth, HYPE is shown to address semantic paradoxes such as the Liar Paradox by extending non-classical fixed-point interpretations of truth by a conditional as well-behaved as that of intuitionistic logic. Finally, HYPE may be used as a background system for modal operators that create hyperintensional contexts, though the details of this application need to be left to follow-up work. (shrink)

Deflationists about truth hold that the function of the truth predicate is to enable us to make certain assertions we could not otherwise make. Pragmatists claim that the utility of negation lies in its role in registering incompatibility. The pragmatist insight about negation has been successfully incorporated into bilateral theories of content, which take the meaning of negation to be inferentially explained in terms of the speech act of rejection. We implement the deflationist insight in a bilateral theory by taking (...) the meaning of the truth predicate to be explained by its inferential relation to assertion. We combine this account of the meaning of the truth predicate with a new diagnosis of the liar paradox: its derivation requires the truth rules to preserve evidence, but these rules only preserve commitment. The result is a novel inferential deflationist theory of truth, which solves the liar paradox in a principled manner. We end by showing that our theory and simple extensions thereof have the resources to axiomatize the internal logic of several supervaluational hierarchies, including Cantini’s. This solves open problems of Halbach (2011) and Horsten (2011). (shrink)

Kripke's theory of partial truth offers a natural solution of the Liar paradox and an appealing explanation of why the Liar sentence seems to lack definite content. It seems vulnerable, however, to...

This article contains an overview of the main problems, themes and theories relating to the semantic paradoxes in the twentieth century. From this historical overview I tentatively draw some lessons about the way in which the field may evolve in the next decade.

Anti-exceptionalism about logic is the Quinean view that logical theories have no special epistemological status, in particular, they are not self-evident or justified a priori. Instead, logical theories are continuous with scientific theories, and knowledge about logic is as hard-earned as knowledge of physics, economics, and chemistry. Once we reject apriorism about logic, however, we need an alternative account of how logical theories are justified and revised. A number of authors have recently argued that logical theories are justified by abductive (...) argument (e.g. Gillian Russell, Graham Priest, Timothy Williamson). This paper explores one crucial question about the abductive strategy: what counts as evidence for a logical theory? I develop three accounts of evidential confirmation that an anti-exceptionalist can accept: (1) intuitions about validity, (2) the Quine-Williamson account, and (3) indispensability arguments. I argue, against the received view, that none of the evidential sources support classical logic. (shrink)