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 a principle of substitutivity of logical equivalents salve veritate and a version of Leibniz’s law are formulated and each is shown to cause problems when combined with naive truth theories.

A number of recent works consider treating validity as a primitive notion rather than one defined in some standard manner. There seem to have been three motivations. First, to understand how truth and validity interact in potentially paradoxical settings. Second, to argue that validity is in fact afflicted with paradoxes analogous to the semantic paradoxes. Third, to develop a ‘deflationary’ conception of validity or consequence. This article treats the notion of validity as a primitive notion and shows how to provide (...) a consistent theory of classical validity (and self-applicative truth), conservative over Peano arithmetic. (shrink)

In a language for arithmetic with a predicate T, intended to mean “ x is the Gödel number of a true sentence”, a set S of axioms and rules of inference has the truth disjunction property if whenever S ⊢ T ∨ T, either S ⊢ T or S ⊢ T. Similarly, S has the truth existence property if whenever S ⊢ ∃χ T ), there is some n such that S ⊢ T ). Continuing previous work, we establish whether (...) these properties hold or fail for a large collection of possible axiomatic systems. (shrink)

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)

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: From ¬(p (...) ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another. (shrink)

A subtheory of the theory of self-referential truth known as FS is shown to be weak as a theory of truth but equivalent to full FS in its proof-theoretic strength.

The difficulties with formalizing the intensional notions necessity, knowability and omniscience, and rational belief are well-known. If these notions are formalized as predicates applying to (codes of) sentences, then from apparently weak and uncontroversial logical principles governing these notions, outright contradictions can be derived. Tense logic is one of the best understood and most extensively developed branches of intensional logic. In tense logic, the temporal notions future and past are formalized as sentential operators rather than as predicates. The question therefore (...) arises whether the notions that are investigated in tense logic can be consistently formalized as predicates. In this paper it is shown that the answer to this question is negative. The logical treatment of the notions of future and past as predicates gives rise to paradoxes due the specific interplay between both notions. For this reason, the tense paradoxes that will be presented are not identical to the paradoxes referred to above. (shrink)

I survey some important semantical and axiomatic theories of self-referential truth. Kripke's fixed-point theory, the revision theory of truth and appraoches involving fuzzy logic are the main examples of semantical theories. I look at axiomatic theories devised by Cantini, Feferman, Freidman and Sheard. Finally some applications of the theory of self-referential truth are considered.

We investigate axiomatizations of Kripke's theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman's axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke's semantics in the straightforward sense: only the sentences that can be proved to be true in KF are valid in Kripke's partial models. Reinhardt proposed to focus just on the sentences that can be proved to be true in (...) KF and conjectured that the detour through classical logic in KF is dispensable. We refute Reinhardt's Conjecture, and provide a direct axiomatization PKF of Kripke's theory in partial logic. We argue that any natural axiomatization of Kripke's theory in Strong Kleene logic has the same proof-theoretic strength as PKF, namely the strength of the system RA< ωω ramified analysis or a system of Tarskian ramified truth up to ωω. Thus any such axiomatization is much weaker than Feferman's axiomatization KF in classical logic, which is equivalent to the system RA<ε₀ of ramified analysis up to ε₀. (shrink)

Fitch's argument purports to show that if all truths are knowable then all truths are known. The argument exploits the fact that the knowledge predicate or operator is untyped and may thus apply to sentences containing itself. This article outlines a response to Fitch's argument based on the idea that knowledge is typed. The first part of the article outlines the philosophical motivation for the view, comparing it to the motivation behind typing truth. The second, formal part presents a logic (...) in which knowledge is typed and demonstrates that it allows nonlogical truths to be knowable yet unknown. (shrink)

To the axioms of Peano arithmetic formulated in a language with an additional unary predicate symbol T we add the rules of necessitation φ/Tφ and conecessitation T φ/φ and axioms stating that T commutes with the logical connectives and quantifiers. By a result of McGee this theory is w-inconsistent, but it can be approximated by models obtained by a kind of rule-of-revision semantics. Furthermore we prove that FS is equivalent to a system already studied by Friedman and Sheard and give (...) an analysis of its proof theory. (shrink)

To the axioms of Peano arithmetic formulated in a language with an additional unary predicate symbol T we add the rules of necessitation and conecessitation T and axioms stating that T commutes with the logical connectives and quantifiers. By a result of McGee this theory is -inconsistent, but it can be approximated by models obtained by a kind of rule-of-revision semantics. Furthermore we prove that FS is equivalent to a system already studied by Friedman and Sheard and give an analysis (...) of its proof theory. (shrink)

Ali Enayat had asked whether two halves of Disjunctive Correctness ([Formula: see text]) for the compositional truth predicate are conservative over Peano Arithmetic (PA). In this paper, we show that the principle “every true disjunction has a true disjunct” is equivalent to bounded induction for the compositional truth predicate and thus it is not conservative. On the other hand, the converse implication “any disjunction with a true disjunct is true” can be conservatively added to [Formula: see text]. The methods introduced (...) here allow us to give a direct nonconservativeness proof for [Formula: see text]. (shrink)

This paper motivates and defends alethic nihilism, the theory that nothing is true. I first argue that alethic paradoxes like the Liar and Curry motivate nihilism; I then defend the view from objections. The critical discussion has two primary outcomes. First, a proof of concept. Alethic nihilism strikes many as silly or obviously false, even incoherent. I argue that it is in fact well-motivated and internally coherent. Second, I argue that deflationists about truth ought to be nihilists. Deflationists maintain that (...) the utility of the truth predicate is exhausted by its expressive role, and I argue that the truth predicate can still play this expressive role even if nothing is true. As such, deflationists do not stand to lose anything by accepting nihilism. Since they also stand to gain an elegant solution to the alethic paradoxes, on balance deflationists ought to be nihilists. (shrink)

In this essay we introduce a new tool for studying the patterns of sentential reference within the framework introduced in [2] and known as the language of paradox $\mathcal {L}_{\mathsf {P}}$ : strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms. In particular, we show that (i) strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms between $\mathcal {L}_{\mathsf {P}}$ constructions preserve paradoxicality, (ii) many (but not all) earlier results regarding the paradoxicality of $\mathcal {L}_{\mathsf {P}}$ constructions can be recast as special cases of our central result regarding (...) strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms, and (iii) that we can use strong $\mathcal {L}_{\mathsf { P}}$ -homomorphisms to provide a simple demonstration of the paradoxical nature of a well-known paradox that has not received much attention in this context: the McGee paradox. In addition, along the way we will highlight how strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms highlight novel connections between the graph-theoretic analyses of paradoxes mobilized in the $\mathcal {L}_{\mathsf {P}}$ framework and the methods and tools of category theory. (shrink)

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)

The notion of implicit commitment has played a prominent role in recent works in logic and philosophy of mathematics. Although implicit commitment is often associated with highly technical studies, it remains so far an elusive notion. In particular, it is often claimed that the acceptance of a mathematical theory implicitly commits one to the acceptance of a Uniform Reflection Principle for it. However, philosophers agree that a satisfactory analysis of the transition from a theory to its reflection principle is still (...) lacking. We provide an axiomatization of the minimal commitments implicit in the acceptance of a mathematical theory. The theory entails that the Uniform Reflection Principle is part of one's implicit commitments, and sheds light on the reason why this is so. We argue that the theory has interesting epistemological consequences in that it explains how justified belief in the axioms of a theory can be preserved to the corresponding reflection principle. The theory also improves on recent proposals for the analysis of implicit commitment based on truth or epistemic notions. (shrink)

What Bar-On and Simmons call 'Conceptual Deflationism' is the thesis that truth is a 'thin' concept in the sense that it is not suited to play any explanatory role in our scientific theorizing. One obvious place it might play such a role is in semantics, so disquotationalists have been widely concerned to argued that 'compositional principles', such as -/- (C) A conjunction is true iff its conjuncts are true -/- are ultimately quite trivial and, more generally, that semantic theorists have (...) misconceived the relation between truth, meaning, and logic. This paper argues, to the contrary, that even such simple compositional principles as (C) have substantial content that cannot be captured by deflationist 'proofs' of them. The key thought is that (C) is supposed, among other things, to affirm the truth-functionality of conjunction and that disquotationalists cannot, ultimately, make sense of truth-functionality. -/- This paper is something of a companion to "The Logical Strength of Compositional Principles". (shrink)

In Replacing Truth, Scharp takes the concept of truth to be fundamentally incoherent. As such, Scharp reckons it to be unsuited for systematic philosophical theorising and in need of replacement – at least for regions of thought and talk which permit liar sentences and their ilk to be formulated. This replacement methodology is radical because it not only recommends that the concept of truth be replaced, but that the word ‘true’ be replaced too. Only Tarski has attempted anything like it (...) before. I dub such a view Conceptual Marxism. In assessing this view, my goals are fourfold: to summarise the many components of Scharp’s theory of truth; to highlight what I take to be some of the excess baggage carried by the view; to assess whether, and to what extent, the extreme methodology on offer is at all called for; finally, to briefly propose a less radical replacement strategy for resolving the liar paradox. (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)

We argue that distinct conditionals—conditionals that are governed by different logics—are needed to formalize the rules of Truth Introduction and Truth Elimination. We show that revision theory, when enriched with the new conditionals, yields an attractive theory of truth. We go on to compare this theory with one recently proposed by Hartry Field.

Most work on the semantic paradoxes within classical logic has centered around what this essay calls “linguistic” accounts of the paradoxes: they attribute to sentences or utterances of sentences some property that is supposed to explain their paradoxical or nonparadoxical status. “No proposition” views are paradigm examples of linguistic theories, although practically all accounts of the paradoxes subscribe to some kind of linguistic theory. This essay shows that linguistic accounts of the paradoxes endorsing classical logic are subject to a particularly (...) acute form of the revenge paradox: that there is no exhaustive classification of sentences into “good” and “bad” such that the T-schema holds when restricted to the “good” sentences unless it is also possible to prove some “bad” sentences. The foundations for an alternative classical nonlinguistic approach is outlined that is not subject to the same kinds of problems. Although revenge paradoxes of different strengths can be formulated, they are found to be indeterminate at higher orders and not inconsistent. (shrink)

Some theorists have developed formal approaches to truth that depend on counterexamples to the structural rules of contraction. Here, we study such approaches, with an eye to helping them respond to a certain kind of objection. We define a contractive relative of each noncontractive relation, for use in responding to the objection in question, and we explore one example: the contractive relative of multiplicative-additive affine logic with transparent truth, or MAALT. -/- .

We present a theory VF of partial truth over Peano arithmetic and we prove that VF and ID 1 have the same arithmetical content. The semantics of VF is inspired by van Fraassen's notion of supervaluation.

The first attempt at a systematic approach to axiomatic theories of truth was undertaken by Friedman and Sheard (Ann Pure Appl Log 33:1–21, 1987). There twelve principles consisting of axioms, axiom schemata and rules of inference, each embodying a reasonable property of truth were isolated for study. Working with a base theory of truth conservative over PA, Friedman and Sheard raised the following questions. Which subsets of the Optional Axioms are consistent over the base theory? What are the proof-theoretic strengths (...) of the consistent theories? The first question was answered completely by Friedman and Sheard; all subsets of the Optional Axioms were classified as either consistent or inconsistent giving rise to nine maximal consistent theories of truth.They also determined the proof-theoretic strength of two subsets of the Optional Axioms. The aim of this paper is to continue the work begun by Friedman and Sheard. We will establish the proof-theoretic strength of all the remaining seven theories and relate their arithmetic part to well-known theories ranging from PA to the theory of ${\Sigma^1_1}$ dependent choice. (shrink)

It is widely accepted that a theory of truth for arithmetic should be consistent, but -consistency is a highly desirable feature for such theories. The point has already been made for first-order languages, though the evidence is not entirely conclusive. We show that in the second-order case the consequence of adopting -inconsistent theories of truth are considered: the revision theory of nearly stable truth T # and the classical theory of symmetric truth FS. Briefly, we present some conceptual problems with (...) ω-inconsistent theories, and demonstrate some technical results that support our criticisms of such theories. (shrink)

Definitional and axiomatic theories of truth -- Objects of truth -- Tarski -- Truth and set theory -- Technical preliminaries -- Comparing axiomatic theories of truth -- Disquotation -- Classical compositional truth -- Hierarchies -- Typed and type-free theories of truth -- Reasons against typing -- Axioms and rules -- Axioms for type-free truth -- Classical symmetric truth -- Kripke-Feferman -- Axiomatizing Kripke's theory in partial logic -- Grounded truth -- Alternative evaluation schemata -- Disquotation -- Classical logic -- Deflationism (...) -- Reflection -- Ontological reduction -- Applying theories of truth. (shrink)

This paper compares the roles classical and intuitionistic logic play in restricting the free use of truth principles in arithmetic. We consider fifteen of the most commonly used axiomatic principles of truth and classify every subset of them as either consistent or inconsistent over a weak purely intuitionistic theory of truth.

Structural realism has been proposed as an epistemological position interpolating between realism and sceptical anti-realism about scientific theories. The structural realist who accepts a scientific theory thinks that is empirically correct, and furthermore is a realist about the ‘structural content’ of . But what exactly is ‘structural content’? One proposal is that the ‘structural content’ of a scientific theory may be associated with its Ramsey sentence (). However, Demopoulos and Friedman have argued, using ideas drawn from Newman's earlier criticism of (...) Russell's structuralism, that this move fails to achieve an interesting intermediate position between realism and anti-realism. Rather, () adds little content beyond the instrumentalistically acceptable claim that the theory is empirically adequate. Here, I formulate carefully the crucial claim of Demopoulos and Friedman, and show that the Ramsey sentence () is true just in case possesses a full model which is empirically correct and satisfies a certain cardinality condition on its theoretical domain. This suggests that structural realism is not a position significantly different from the anti-realism it attempts to distinguish itself from. Introduction Technical framework Ramsification Empirical adequacy Ramsification empirical adequacy + cardinality constraint Conclusion. (shrink)

The proof-theoretic results on axiomatic theories oftruth obtained by different authors in recent years are surveyed.In particular, the theories of truth are related to subsystems ofsecond-order analysis. On the basis of these results, thesuitability of axiomatic theories of truth for ontologicalreduction is evaluated.

About twenty-five years ago, Charles Parsons published a paper that began by asking why we still discuss the Liar Paradox. Today, the question seems all the more apt. In the ensuing years we have seen not only Parsons’ work (1974), but seminal work of Saul Kripke (1975), and a huge number of other important papers. Too many to list. Surely, one of them must have solved it! In a way, most of them have. Most papers on the Liar Paradox offer (...) some explanation of the behavior of paradoxical sentences, and most also offer some extension for the predicate ‘true’ that they think is adequate, at least in some restricted setting. But if this is a solution, then the problem we face is far from a lack of solutions; rather, we have an overabundance of conflicting ones. Kripke’s work alone provides us with uncountably many different extensions for the truth predicate. Even if it so happens that one of these is a conclusive solution, we do not seem to know which one, or why. We should also ask, given that we are faced with many technically elegant but contradictory views, if they are really all addressing the same problem. What we lack is not solutions, but a way to compare and evaluate the many ones we have. (shrink)

I here investigate the sense in which diagonalization allows one to construct sentences that are self-referential. Truly self-referential sentences cannot be constructed in the standard language of arithmetic: There is a simple theory of truth that is intuitively inconsistent but is consistent with Peano arithmetic, as standardly formulated. True self-reference is possible only if we expand the language to include function-symbols for all primitive recursive functions. This language is therefore the natural setting for investigations of self-reference.

If □ is conceived as an operator, i.e., an expression that gives applied to a formula another formula, the expressive power of the language is severely restricted when compared to a language where □ is conceived as a predicate, i.e., an expression that yields a formula if it is applied to a term. This consideration favours the predicate approach. The predicate view, however, is threatened mainly by two problems: Some obvious predicate systems are inconsistent, and possible-worlds semantics for predicates of (...) sentences has not been developed very far. By introducing possible-worlds semantics for the language of arithmetic plus the unary predicate □, we tackle both problems. Given a frame (W, R) consisting of a set W of worlds and a binary relation R on W, we investigate whether we can interpret □ at every world in such a way that □ $\ulcorner A \ulcorner$ holds at a world ᵆ ∊ W if and only if A holds at every world $\upsilon$ ∊ W such that ᵆR $\upsilon$ . The arithmetical vocabulary is interpreted by the standard model at every world. Several 'paradoxes' (like Montague's Theorem, Gödel's Second Incompleteness Theorem, McGee's Theorem on the ω-inconsistency of certain truth theories, etc.) show that many frames, e.g., reflexive frames, do not allow for such an interpretation. We present sufficient and necessary conditions for the existence of a suitable interpretation of □ at any world. Sound and complete semi-formal systems, corresponding to the modal systems K and K4, for the class of all possible-worlds models for predicates and all transitive possible-worlds models are presented. We apply our account also to nonstandard models of arithmetic and other languages than the language of arithmetic. (shrink)

A common objection to hierarchical approaches to truth is that they fragment the concept of truth. This paper defends hierarchical approaches in general against the objection of fragmentation. It argues that the fragmentation required is familiar and unprob-lematic, via a comparison with mathematical proof. Furthermore, it offers an explanation of the source and nature of the fragmentation of truth. Fragmentation arises because the concept exhibits a kind of failure of closure under reflection. This paper offers a more precise characterization of (...) the reflection involved, first in the setting of formal theories of truth, and then in a more general setting. (shrink)

The paper shows how we can add a truth predicate to arithmetic (or formalized syntactic theory), and keep the usual truth schema Tr( ) ↔ A (understood as the conjunction of Tr( ) → A and A → Tr( )). 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. (shrink)

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.

This papers deals with the class of axiomatic theories of truth for semantically closed languages, where the theories do not allow for standard models; i.e., those theories cannot be interpreted as referring to the natural number codes of sentences only (for an overview of axiomatic theories of truth in general, see Halbach[6]). We are going to give new proofs for two well-known results in this area, and we also prove a new theorem on the nonstandardness of a certain theory of (...) truth. The results indicate that the proof strategies for all the theorems on the nonstandardness of such theories are "essentially" of the same kind of structure. (shrink)

This is the second part of a paper dealing with truth and translation. In Part A a revised version of Tarski's Convention T has been presented, which explicitly refers to a translation mapping from the object language to the metalanguage; the vague notion of a translation has been replaced by a precise definition. At the end of Part A it has been shown that interpreted languages exist, which allow for vicious self-reference but which nevertheless contain their own truth predicate - (...) this is possible if truth is based on a nonstandard translation mapping. However, this result has only been proved for languages without quantifiers. In Part B we now extend the result to first-order languages, and we show that this can be done in three different ways. In each case, the addition of a truth predicate to an interpreted language with a high degree of expressiveness leads to changes in the ontology of the language. (shrink)

We give a survey on truth theories for applicative theories. It comprises Frege structures, universes for Frege structures, and a theory of supervaluation. We present the proof-theoretic results for these theories and show their syntactical expressive power. In particular, we present as a novelty a syntactical interpretation of ID1 in a applicative truth theory based on supervaluation.

The uniform reflection principle for the theory of uniform T-sentences is added to PA. The resulting system is justified on the basis of a disquotationalist theory of truth where the provability predicate is conceived as a special kind of analyticity. The system is equivalent to the system ACA of arithmetical comprehension. If the truth predicate is also allowed to occur in the sentences that are inserted in the T-sentences, yet not in the scope of negation, the system with the reflection (...) schema for these T-sentences assumes the strength of the Kripke-Feferman theory KF, and thus of ramified analysis up to go. (shrink)

This paper propounds a systematic examination of the link between the Knower Paradox and provability interpretations of modal logic. The aim of the paper is threefold: to give a streamlined presentation of the Knower Paradox and related results; to clarify the notion of a syntactical treatment of modalities; finally, to discuss the kind of solution that modal provability logic provides to the Paradox. I discuss the respective strength of different versions of the Knower Paradox, both in the framework of first-order (...) arithmetic and in that of modal logic with fixed point operators. It is shown that the notion of a syntactical treatment of modalities is ambiguous between a self-referential treatment and a metalinguistic treatment of modalities, and that these two notions are independent. I survey and compare the provability interpretations of modality respectively given by Skyrms, B. (1978, The Journal of Philosophy 75: 368–387) Anderson, C.A. (1983, The Journal of Philosophy 80: 338–355) and Solovay, R. (1976, Israel Journal of Mathematics 25: 287–304). I examine how these interpretations enable us to bypass the limitations imposed by the Knower Paradox while preserving the laws of classical logic, each time by appeal to a distinct form of hierarchy. (shrink)

We formulate and explore two basic axiomatic systems of type-free subjective probability. One of them explicates a notion of finitely additive probability. The other explicates a concept of infinitely additive probability. It is argued that the first of these systems is a suitable background theory for formally investigating controversial principles about type-free subjective probability.

Truth predicates are widely believed to be capable of serving a certain logical or quasi-logical function. There is little consensus, however, on the exact nature of this function. We offer a series of formal results in support of the thesis that disquotational truth is a device to simulate higher-order resources in a first-order setting. More specifically, we show that any theory formulated in a higher-order language can be naturally and conservatively interpreted in a first-order theory with a disquotational truth or (...) truth-of predicate. In the first part of the paper we focus on the relation between truth and full impredicative sentential quantification. The second part is devoted to the relation between truth-of and full impredicative predicate quantification. (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)