The aim of this paper is twofold: first, I provide a cluster of theories of truth in classical logic that is (internally) consistent with global reflection principles: the theories of positive truth (and falsity). After that, I analyse the _epistemic value_ of such theories. I do so employing the framework of cognitive projects introduced by Wright (Proc Aristot Soc 78:167–245, 2004), and employed—in the context of theories of truth—by Fischer et al. (Noûs 2019. https://doi.org/10.1111/nous.12292 ). In particular, I will argue (...) that theories of positive truth are _trustworthy_, analogously to the theories of full disquotational truth. Moreover, I argue that, for a given cognitive project, _if_ the acceptance of trustworthy theories is taken to be an _epistemic norm_ of cognitive project, then one has good reasons to accept theories of positive truth over other rival theories of truth in classical logic. On the other hand, the latter theories are deemed epistemically unacceptable. (shrink)

An old and well-known objection to non-classical logics is that they are too weak; in particular, they cannot prove a number of important mathematical results. A promising strategy to deal with this objection consists in proving so-called recapture results. Roughly, these results show that classical logic can be used in mathematics and other unproblematic contexts. However, the strategy faces some potential problems. First, typical recapture results are formulated in a purely logical language, and do not generalize nicely to languages containing (...) the kind of vocabulary that usually motivates non-classical theories—for example, a language containing a naïve truth predicate. Second, proofs of recapture results typically employ classical principles that are not valid in the targeted non-classical system; hence, non-classical theorists do not seem entitled to those results. In this paper, we analyze these problems and provide solutions on behalf of non-classical theorists. To address the first problem, we provide a novel kind of recapture result, which generalizes nicely to a truth-theoretic language. As for the second problem, we argue that it relies on an ambiguity and that, once the ambiguity is removed, there are no reasons to think that non-classical logicians are not entitled to their recapture results. (shrink)

In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

We present an overview of typed and untyped disquotational truth theories with the emphasis on their (non)conservativity over the base theory of syntax. Two types of conservativity are discussed: syntactic and semantic. We observe in particular that TB—one of the most basic disquotational theories—is not semantically conservative over its base; we show also that an untyped disquotational theory PTB is a syntactically conservative extension of Peano Arithmetic.

Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection principles (...) and principles of mathematical and transfinite induction as well as the status of the latter with respect to various foundational characterizations of number theory. (shrink)

Why is it that even strong formal theories of truth fail to prove their own consistency? Although Field has addressed this question for many theories of truth, I argue that there is an important and attractive class of theories of truth that he omitted in his analysis. Such theories cannot prove that all their axioms are true, though unlike many of the cases Field considers, they do not prove that any of their axioms are false or that any of their (...) rules of inference are not truth preserving. I argue that it is the fact that such theories are not finitely axiomatizable that stops them from proving their own consistency. (shrink)

In this paper I’ll explore the relation between ω-inconsistency and plain inconsistency, in the context of theories that intend to capture semantic concepts. In particular, I’ll focus on two very well known inconsistent but non-trivial theories of truth: LP and STTT. Both have the interesting feature of being able to handle semantic and arithmetic concepts, maintaining the standard model. However, it can be easily shown that both theories are ω- inconsistent. Although usually a theory of truth is generally expected to (...) be ω-consistent, all conceptual concerns don’t apply to inconsistent theories. Finally, I’ll explore if it’s possible to have an inconsistent, butω-consistent theory of truth, restricting my analysis to substructural theories. (shrink)

Our main goal is to investigate whether the infinitary rules for the quantifiers endorsed by Elia Zardini in a recent paper are plausible. First, we will argue that they are problematic in several ways, especially due to their infinitary features. Secondly, we will show that even if these worries are somehow dealt with, there is another serious issue with them. They produce a truth-theoretic paradox that does not involve the structural rules of contraction.

I present the traditional debate about the so called explanation of Russell’s paradox and propose a new way to solve the contradiction that arises in Frege’s system. I briefly examine two alternative explanatory proposals—the Predicativist explanation and the Cantorian one—presupposed by almost all the proposed solutions of Russell’s Paradox. From the discussion about these proposals a controversial conclusion emerges. Then, I examine some particular zig zag solutions and I propose a third explanation, presupposed by them, in which I emphasise the (...) role of an implicit premise in the derivation of the paradox. In conclusion, I propose a different zig zag solution obtained by the adoption of a negative free logic. (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.

One of the popular explications of the deflationary tenet of ‘thinness’ of truth is the conservativeness demand: the declaration that a deflationary truth theory should be conservative over its base. This paper contains a critical discussion and assessment of this demand. We ask and answer the question of whether conservativity forms a part of deflationary doctrines.

Disquotational theories of truth are often criticised for being too weak to prove interesting generalisations about truth. In this paper we will propose a certain formal theory to serve as a framework for a solution of the generalisation problem. In contrast with Horwich’s original proposal, our framework will eschew psychological notions altogether, replacing them with the epistemic notion of believability. The aim will be to explain why someone who accepts a given disquotational truth theory Th, should also accept various generalisations (...) not provable in Th. The strategy will consist of the development of an axiomatic theory of believability, one permitting us to show how to derive the believability of generalisations from basic axioms that characterise the believability predicate, together with the information that Th is a theory of truth that we accept. (shrink)

This article compares classical (or -like) and nonclassical (or -like) axiomatisations of the fixed-point semantics developed by Kripke (J Philos 72(19): 690–716, 1975). Following the line of investigation of Halbach and Nicolai (J Philos Logic 47(2): 227–257, 2018), we do not compare and qua theories of truth simpliciter, but rather qua axiomatisations of the Kripkean conception of truth. We strengthen the central results of Halbach and Nicolai (2018) and Nicolai (Stud Log 106(1): 101–130, 2018), showing that, on the one hand, (...) there is a stronger sense in which some variants of and some variants of can be taken to be, truth-theoretically, equivalent. On the other hand, we show that this truth-theoretical equivalence is not preserved by some other variants of and, arguing that the variants are more adequate axiomatisations of the fixed-point semantics than the corresponding variants. (shrink)

Truth is a fundamental philosophical concept that, despite its common and everyday use, has resisted common-sense formulations. At this point, one may legitimately wonder if there even is a common-sense notion of truth or what it could look like. In response, I propose here a common-sense account of truth based on four “truisms” that set a baseline for how to go about building an account of truth. Drawing on both ordinary language philosophy and contemporary pragmatic approaches to truth, I defend (...) a pragmatic, common-sense theory of truth. The result is a theory that focuses the use and function of truth while also emphasizing its “subject-independence.”. (shrink)

We present a new proposal for what to do at limits in the revision theory. The usual criterion for a limit stage is that it should agree with any definite verdicts that have been brought about before that stage. We suggest that one should not only consider definite verdicts that have been brought about but also more general properties; in fact any closed property can be considered. This more general framework is required if we move to considering revision theories for (...) concepts that are concerned with real numbers, but also has consequences for more traditional revision theories such as the revision theory of truth. (shrink)

We present a semantics for a language that includes sentences that can talk about their own probabilities. This semantics applies a fixed point construction to possible world style structures. One feature of the construction is that some sentences only have their probability given as a range of values. We develop a corresponding axiomatic theory and show by a canonical model construction that it is complete in the presence of the ω-rule. By considering this semantics we argue that principles such as (...) introspection, which lead to paradoxical contradictions if naively formulated, should be expressed by using a truth predicate to do the job of quotation and disquotation and observe that in the case of introspection the principle is then consistent. (shrink)

According to truthmaker maximalism, each truth has a truthmaker. Peter Milne has attempted to refute truthmaker maximalism on mere logical grounds via the construction of a self-referential truthmaker sentence M “saying” of itself that it doesn’t have a truthmaker. Milne argues that M turns out to be a true sentence without a truthmaker and thus provides a counterexample to truthmaker maximalism. In this paper, I show that Milne’s refutation of truthmaker maximalism does not succeed. In particular, I argue that the (...) notion of truthmaker meets two structural principles which, if added to a formal language of a theory, are already sufficient to produce a provable contradiction—a contradiction that gives rise to a socalled “Truthmaker paradox”. I also address the question of how to possibly resolve the Truthmaker paradox. I thereby show that the Truthmaker paradox, just as the strengthened Liar paradox, yields a “revenge problem” for paracomplete theories and might lead to triviality for Priest’s dialetheist account LP if the notion of truthmaker is defined as a certain semantic predicate within LP. But regardless of how one tries to cope with the Truthmaker paradox, this paradox is surely interesting in its own right. However, its significance is completely orthogonal to the question of whether truthmaker maximalism is a philosophically sound view. (shrink)

A theory of truth is usually demanded to be consistent, but -consistency is less frequently requested. Recently, Yatabe has argued in favour of -inconsistent first-order theories of truth, minimising their odd consequences. In view of this fact, in this paper, we present five arguments against -inconsistent theories of truth. In order to bring out this point, we will focus on two very well-known -inconsistent theories of truth: the classical theory of symmetric truth FS and the non-classical theory of naïve truth (...) based on ᴌukasiewicz infinitely valued logic: PAᴌT. (shrink)

The aim of this paper is to show that it’s not a good idea to have a theory of truth that is consistent but ω-inconsistent. In order to bring out this point, it is useful to consider a particular case: Yablo’s Paradox. In theories of truth without standard models, the introduction of the truth-predicate to a first order theory does not maintain the standard ontology. Firstly, I exhibit some conceptual problems that follow from so introducing it. Secondly, I show that (...) in second order theories with standard semantics the same procedure yields a theory that doesn’t have models. So, while having an ω- inconsistent theory is a bad thing, having an unsatisfiable theory of truth is actually worse. This casts doubts on whether the predicate in question is, after all, a truthpredicate for that language. Finally, I present some alternatives to prove an inconsistency adding plausible principles to certain theories of truth. (shrink)

Predicate approaches to modality have been a topic of increased interest in recent intensional logic. Halbach and Welch :71–100, 2009) have proposed a new formal technique to reduce the necessity predicate to an operator, demonstrating that predicate and operator methods are ultimately compatible. This article concerns the question of whether Halbach and Welch’s approach can provide a uniform formal treatment for intensionality. I show that the monotonicity constraint in Halbach and Welch’s proof for necessity fails for almost all possible-worlds theories (...) of knowledge. The nonmonotonicity results demonstrate that the most obvious way of emulating Halbach and Welch’s rapprochement of the predicate and operator fails in the epistemic setting. (shrink)

In this paper, I address some of the chief challenges, or problems, for Deflationary Theories of Truth, viz., the Generalization Problem, the Conservativeness Argument, and the Success Argument.

This paper develops the idea that valid arguments are equivalent to true conditionals by combining Kripke’s theory of truth with the evidential account of conditionals offered by Crupi and Iacona. As will be shown, in a first-order language that contains a naïve truth predicate and a suitable conditional, one can define a validity predicate in accordance with the thesis that the inference from a conjunction of premises to a conclusion is valid when the corresponding conditional is true. The validity predicate (...) so defined significantly increases our expressive resources and provides a coherent formal treatment of paradoxical arguments. (shrink)

Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can be (...) overcome. We introduce the concept of purity for theories of arithmetic: a theory of arithmetic is pure when it only proves arithmetical truths. Then, we argue that, under Isaacson’s thesis, some PA-provable truths—including transfinite induction claims for infinite ordinals and some consistency statements—are seemingly not arithmetical in Isaacson’s sense, and hence that Isaacson’s thesis might entail the impurity of PA. Nonetheless, we conjecture that the advocate of Isaacson’s thesis can avoid this undesirable consequence: the arithmetical nature, as understood by Isaacson, of all contentious PA-provable statements can be justified. As a case study, we explore how this is done for transfinite induction claims with infinite ordinals below ε0. To this end, we show that the PA-proof of such claims employs exclusively resources from finite mathematics, and that ordinals below ε0 are finitary objects despite being infinite. (shrink)

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)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (shrink)

This anthology of the very latest research on truth features the work of recognized luminaries in the field, put together following a rigorous refereeing process. Along with an introduction outlining the central issues in the field, it provides a unique and unrivaled view of contemporary work on the nature of truth, with papers selected from key conferences in 2011 such as Truth Be Told, Truth at Work, Paradoxes of Truth and Denotation and Axiomatic Theories of Truth. Studying the nature of (...) the concept of ‘truth’ has always been a core role of philosophy, but recent years have been a boom time in the topic. With a wealth of recent conferences examining the subject from various angles, this collection of essays recognizes the pressing need for a volume that brings scholars up to date on the arguments. Offering academics and graduate students alike a much-needed repository of today’s cutting-edge work in this vital topic of philosophy, the volume is required reading for anyone needing to keep abreast of developments, and is certain to act as a catalyst for further innovation and research. (shrink)

I will argue that the standard formulation of non-factualism in terms of a denial of truth-aptness is consistent with a version of deflationsim. My line of argument assumes the use conception of meaning. This brings out an interesting consequence since mostly the philosophers who endorse the use conception of meaning, e.g. Paul Horwich, hold that deflationism is inconsistent with the strategy of implementing non-factualism in terms of a denial of truth-aptness and thereby urge a reformulation of non-factualism.

In recent decades deflationary theories of truth have been challenged with a technical argument based on the notion of conservativeness. In this paper, I shall stress that conservative extensions of theories and expandability of their models are not equivalent notions. Then, I shall argue that the deflationary thesis of the unsubstantiality of truth is better understood as leveraging on the stronger notion of expandability of models. Once expandability is involved in the argument, some notable consequences follow: the strategy proposed by (...) Hartry Field in response to the conservativeness objection is strongly undermined and even simpler proposals (such as theories based on standard t-sentences) are shown to be quite problematical. (shrink)

The notion of harmony has played a pivotal role in a number of debates in the philosophy of logic. Yet there is little agreement as to how the requirement of harmony should be spelled out in detail or even what purpose it is to serve. Most, if not all, conceptions of harmony can already be found in Michael Dummett's seminal discussion of the matter in The Logical Basis of Metaphysics. Hence, if we wish to gain a better understanding of the (...) notion of harmony, we do well to start here. Unfortunately, however, Dummett's discussion is not always easy to follow. The following is an attempt to disentangle the main strands of Dummett's treatment of harmony. The different variants of harmony as well as their interrelations are clarified and their individual shortcomings qua interpretations of harmony are demonstrated. Though no attempt is made to give a detailed alternative account of harmony here, it is hoped that our discussion will lay the ground for an adequate rigorous treatment of this central notion. (shrink)

Kripke’s theory of truth is arguably the most influential approach to self-referential truth and the semantic paradoxes. The use of a partial evaluation scheme is crucial to the theory and the most prominent schemes that are adopted are the strong Kleene and the supervaluation scheme. The strong Kleene scheme is attractive because it ensures the compositionality of the notion of truth. But under the strong Kleene scheme classical tautologies do not, in general, turn out to be true and, as a (...) consequence, classical reasoning is no longer admissible once the notion of truth is involved. The supervaluation scheme adheres to classical reasoning but violates compositionality. Moreover, it turns Kripke’s theory into a rather complicated affair: to check whether a sentence is true we have to look at all admissible precisification of the interpretation of the truth predicate we are presented with. One consequence of this complicated evaluation condition is that under the supervaluation scheme a more proof-theoretic characterization of Kripke’s theory becomes inherently difficult, if not impossible. In this paper we explore the middle ground between the strong Kleene and the supervaluation scheme and provide an evaluation scheme that adheres to classical reasoning but retains many of the attractive features of the strong Kleene scheme. We supplement our semantic investigation with a novel axiomatic theory of truth that matches the semantic theory we have put forth. (shrink)

In this investigation we explore a general strategy for constructing modal theories where the modal notion is conceived as a predicate. The idea of this strategy is to develop modal theories over axiomatic theories of truth. In this first paper of our two part investigation we develop the general strategy and then apply it to the axiomatic theory of truth Friedman-Sheard. We thereby obtain the theory Modal Friedman-Sheard. The theory Modal Friedman-Sheard is then discussed from three different perspectives. First, we (...) show that Modal Friedman-Sheard preserves theoremhood modulo translation with respect to modal operator logic. Second, we turn to semantic aspects and develop a modal semantics for the newly developed theory. Third, we investigate whether the modal predicate of Modal Friedman-Sheard can be understood along the lines of a proposal of Kripke, namely as a truth predicate modified by a modal operator. (shrink)

In this second and last paper of the two part investigation on "Modality and Axiomatic Theories of Truth" we apply a general strategy for constructing modal theories over axiomatic theories of truth to the theory Kripke-Feferman. This general strategy was developed in the first part of our investigation. Applying the strategy to Kripke-Feferman leads to the theory Modal Kripke-Feferman which we discuss from the three perspectives that we had already considered in the first paper, where we discussed the theory Modal (...) Friedman-Sheard. That is, we first show that Modal Kripke-Feferman preserves theoremhood modulo translation with respect to modal operator logic. Second, we develop a modal semantics fitting the newly developed theory. Third, we investigate whether the modal predicate of Modal Kripke-Feferman can be understood along the lines of a proposal of Kripke, namely as a truth predicate modified by a modal operator. (shrink)

This paper argues for three kinds of possible worlds: Wittgensteinian totalities of facts, Lewisian worlds or universes, concrete objects of maximal essence, and the world, a concrete object of minimal essence. It moreover explains that correspondence truth applies to Wittgensteinian totalities and pragmatic truth to Lewisian universes. And it finally argues that this conceptualization lays proper foundations to two-dimensional semantics.

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)

In this paper we study several translations that map models and formulae of the language of second-order arithmetic to models and formulae of the language of truth. These translations are useful because they allow us to exploit results from the extensive literature on arithmetic to study the notion of truth. Our purpose is to present these connections in a systematic way, generalize some well-known results in this area, and to provide a number of new results. Sections 3 and 4 contain (...) some recursion- and proof-theoretic results about Kripke-style fixed-point theories of truth. Section 5 shows how to derive full second-order arithmetic from principles of truth. Section 6 investigates the proof-theoretic strength of disquotation without an arithmetical base theory. (shrink)

What is the property of being true like? To answer this question, begin with a Canberra-plan analysis of the concept of truth. That is, assemble the platitudes for the concept of truth, and then investigate which property might satisfy them. This project is aided by Friedman and Sheard’s groundbreaking analysis of twelve logical platitudes for truth. It turns out that, because of the paradoxes like the liar, the platitudes for the concept of truth are inconsistent. Moreover, there are so many (...) distinct paradoxes that only small subsets of platitudes for truth are consistent. The result is that there is no property of being true. The failure of the Canberra plan analysis of the concept of truth, points the way toward a new methodology: a conceptual engineering project for the concept of truth. Conceptual engineering is assessing the quality of our concepts, and when they are found defective, offering new and better concepts to replace them for certain purposes. Still, there are many aletheic properties, which are properties satisfied by reasonably large subsets of platitudes for the concept of truth. We can treat these aletheic properties as a guide to the multitude of new aletheic concepts, which are concepts similar to, but distinct from, the concept of truth. Any new aletheic concept or team of concepts might be called on to replace the concept of truth. In particular, the concepts of ascending truth and descending truth are recommended, but the most important point is that we need a full-scale investigation into the space of aletheic properties and new aletheic concepts—that is, we need an Aletheic Principles Project. (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)

We axiomatize Leitgeb's (2005) theory of truth and show that this theory proves all arithmetical sentences of the system of ramified analysis up to $\epsilon_0$. We also give alternative axiomatizations of Kripke's (1975) theory of truth (Strong Kleene and supervaluational version) and show that they are at least as strong as the Kripke-Feferman system KF and Cantini's VF, respectively.

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)

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)

The idea of classical recapture has played a prominent role for non-classical logicians. In the specific case of non-classical theories of truth, although we know that it is not possible to retain classical logic for every statement involving the truth predicate, it is clear that for many such statements this is in principle feasible, and even desirable. What is not entirely obvious or well-known is how far this idea can be pushed. Can the non-classical theorist retain classical logic for every (...) non-paradoxical statement? If not, is she forced to settle for a very weak form of Classical Recapture, or are there robust versions of classical recapture available to her? These are the main questions that I will address in this paper. As a test case I will consider a paracomplete account of the truth-theoretic paradoxes and I will argue for two claims. First, that it is not possible to retain the law of excluded middle for every non-paradoxical statement. Secondly, that there are no robust versions of classical recapture available to the paracomplete logician. (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)

The model of self-referential truth presented in this paper, named Revision-theoretic supervaluation, aims to incorporate the philosophical insights of Gupta and Belnap’s Revision Theory of Truth into the formal framework of Kripkean fixed-point semantics. In Kripke-style theories the final set of grounded true sentences can be reached from below along a strictly increasing sequence of sets of grounded true sentences: in this sense, each stage of the construction can be viewed as an improvement on the previous ones. I want to (...) do something similar replacing the Kripkean sets of grounded true sentences with revision-theoretic sets of stable true sentences. This can be done by defining a monotone operator through a variant of van Fraassen’s supervaluation scheme which is simply based on ω-length iterations of the Tarskian operator. Clearly, all virtues of Kripke-style theories are preserved, and we can also prove that the resulting set of “grounded” true sentences shares some nice features with the sets of stable true sentences which are provided by the usual ways of formalising revision. What is expected is that a clearer philosophical content could be associated to this way of doing revision; hopefully, a content directly linked with the insights underlying finite revision processes. (shrink)

Tagmemic theory as a semiotic theory can be used to analyze multiple systems of logic and to assess their strengths and weaknesses. This analysis constitutes an application of semiotics and also a contribution to understanding of the nature of logic within the context of human meaning. Each system of logic is best adapted to represent one portion of human rationality. Acknowledging this correlation between systems and their targets helps explain the usefulness of more than one system. Among these systems, the (...) two-valued system of classical logic takes its place. All the systems of logic can be incorporated into a complex mathematical model that has a place for each system and that represents a larger whole in human reasoning. The model can represent why tight formal systems of logic can be applied in some contexts with great success, but in other contexts are not directly applicable. The result suggests that human reasoning is innately richer than any one formal system of logic. (shrink)

Stephen Yablo [23,24] introduces a new informal paradox, constituted by an infinite list of semi-formalized sentences. It has been shown that, formalized in a first-order language, Yablo’s piece of reasoning is invalid, for it is impossible to derive falsum from the sequence, due mainly to the Compactness Theorem. This result casts doubts on the paradoxical character of the list of sentences. After identifying two usual senses in which an expression or set of expressions is said to be paradoxical, since second-order (...) languages are not compact, I study the paradoxicality of Yablo’s list within these languages. While non-paradoxical in the first sense, the second-order version of the list is a paradox in our second sense. I conclude that this suffices for regarding Yablo’s original list as paradoxical and his informal argument as valid. (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.