Scholastic and analytic definitions of semantic paradoxes, in terms of groundlessness, circularity, and semantic pathology, are introduced and compared with each other. The fundamental intuitions used in these definitions are the concepts of being true about extralinguistic reality, of making statements about one’s self, and of compatibility with an underlying semantic theory. The three approaches—the groundlessness view, the circularity view, and the semantic pathology view—are shown to differ not only conceptually, but also in their applications. As both a means for (...) showing these differences and as an adequacytest, the so-called two-line puzzles are used, which allows one to address the possibility of making non-paradoxical statements about paradoxical sentences within the same language. (shrink)

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)

The concept of truth arguably plays a central role in many areas of philosophical theorizing. Yet, what seems to be one of the most fundamental principles governing that concept, i.e. the equivalence between P and , is inconsistent in full classical logic, as shown by the semantic paradoxes. I propose a new solution to those paradoxes, based on a principled revision of classical logic. Technically, the key idea consists in the rejection of the unrestricted validity of the structural principle of (...) contraction. I first motivate philosophically this idea with the metaphysical picture of the states-of-affairs expressed by paradoxical sentences as being distinctively . I then proceed to demonstrate that the theory of truth resulting from this metaphysical picture is, in many philosophically interesting respects, surprisingly stronger than most other theories of truth endorsing the equivalence between P and (for example, the theory vindicates the validity of the traditional laws of excluded middle and of non-contradiction, and also vindicates the traditional constraint of truth preservation on logical consequence). I conclude by proving a cutelimination theorem that shows the consistency of the theory. (shrink)

We introduce a variant of pointer structures with denotational semantics and show its equivalence to systems of boolean equations: both have the same solutions. Taking paradoxes to be statements represented by systems of equations (or pointer structures) having no solutions, we thus obtain two alternative means of deciding paradoxical character of statements, one of which is the standard theory of solving boolean equations. To analyze more adequately statements involving semantic predicates, we extend propositional logic with the assertion operator and give (...) its complete axiomatization. This logic is a sub-logic of statements in which the semantic predicates become internalized (for instance, counterparts of Tarski’s definitions and T-schemata become tautologies). Examples of analysis of self-referential paradoxes are given and the approach is compared to the alternative ones. (shrink)

Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, based on (...) the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally ‘belong’, they cease to be paradoxical; yet, it is concluded that the natural choice—for logicians and common people alike—is to stick to closed semantics, pragmatically circumventing problematic utterances. (shrink)

In this paper, I propose that 'true’ is polysemous, and thus ambiguous. I suggest that the semantic paradoxes both motivates taking 'true’ to be polysemous and shows that the concept truth is indefinitely extensible. In doing so, I explain that 'true’ is polysemous between the meanings corresponding to the subconcepts of the concept truth generated by such indefinite extensibility. I conclude that the proposal provides satisfying solutions to the semantic paradoxes.

The paper explores applications of Kripke's theory of truth to semantics for anti-luck epistemology, that is, to subjunctive theories of knowledge. Subjunctive theories put forward modal or subjunctive conditions to rule out knowledge by mere luck as to be found in Gettier-style counterexamples to the analysis of knowledge as justified true belief. Because of the subjunctive nature of these conditions the resulting semantics turns out to be non-monotone, even if it is based on non-classical evaluation schemes such as strong Kleene (...) or FDE. This blocks the usual road to fixed-point results for Kripke's theory of truth within these semantics and consequently the paper is predominantly an exploration of fixed point results for Kripke's theory of truth within non-monotone semantics. Using the theory of quasi-inductive definitions we show that in case of the subjunctive theories of knowledge the so-called Kripke jump will have fixed points despite the non-monotonicity of the semantics: Kripke's theory of truth can be successfully applied in the framework of subjunctive theories of knowledge. (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)

ABSTRACT: This chapter offers a revenge-free solution to the liar paradox (at the centre of which is the notion of Gestalt shift) and presents a formal representation of truth in, or for, a natural language like English, which proposes to show both why -- and how -- truth is coherent and how it appears to be incoherent, while preserving classical logic and most principles that some philosophers have taken to be central to the concept of truth and our use of (...) that notion. The chapter argues that, by using a truth operator rather than truth predicate, it is possible to provide a coherent, model-theoretic representation of truth with various desirable features. After investigating what features of liar sentences are responsible for their paradoxicality, the chapter identifies the logic as the normal modal logic KT4M (= S4M). Drawing on the structure of KT4M (=S4M), the author proposes that, pace deflationism, truth has content, that the content of truth is bivalence, and that the notions of both truth and bivalence are semideterminable. (shrink)

The general thesis of this paper is that metasemantic theories can play a central role in determining the correct solution to the liar paradox. I argue for the thesis by providing a specific example. I show how Lewis’s reference-magnetic metasemantic theory may decide between two of the most influential solutions to the liar paradox: Kripke’s minimal fixed point theory of truth and Gupta and Belnap’s revision theory of truth. In particular, I suggest that Lewis’s metasemantic theory favours Kripke’s solution to (...) the paradox over Gupta and Belnap’s. I then sketch how other standard criteria for assessing solutions to the liar paradox, such as whether a solution faces a so-called revenge paradox, fit into this picture. While the discussion of the specific example is itself important, the underlying lesson is that we have an unused strategy for resolving one of the hardest problems in philosophy. (shrink)

We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s recent (...) models. The ‘defectiveness’ of such diagonal sentences necessarily cannot be classified by any of the determinateness predicates of the model. They are ‘ineffable liars’. We may consider them a response to the claim of Field that ‘the conditional can be used to show that the theory is not subject to “revenge problems”.’. (shrink)

The Surprise Exam Paradox continues to perplex and torment despite the many solutions that have been offered. This paper proposes to end the intrigue once and for all by refuting one of the central pillars of the Surprise Exam Paradox, the 'No Friday Argument,' which concludes that an exam given on the last day of the testing period cannot be a surprise. This refutation consists of three arguments, all of which are borrowed from the literature: the 'Unprojectible Announcement Argument,' the (...) 'Wright & Sudbury Argument,' and the 'Epistemic Blindspot Argument.' The reason that the Surprise Exam Paradox has persisted this long is not because any of these arguments is problematic. On the contrary, each of them is correct. The reason that it has persisted so long is because each argument is only part of the solution. The correct solution requires all three of them to be combined together. Once they are, we may see exactly why the No Friday Argument fails and therefore why we have a solution to the Surprise Exam Paradox that should stick. (shrink)

We introduce a subclass of Kripke's fixed points in which falsehood is the preferred truth value. In all of these the truthteller evaluates to false, while the liar evaluates to undefined (or overdefined). The mathematical structure of this family of fixed points is investigated and is shown to have many nice features. It is noted that a similar class of fixed points, preferring truth, can also be studied. The notion of intrinsic is shown to relativize to these two subclasses. The (...) mathematical ideas presented here originated in investigations of so-called stable models in the semantics of logic programming. (shrink)

We expand on the fixed point semantic approach of Kripke via the addition of two unary intensional operators: a paradoxicality operator Π where Π(Φ) is true at a fixed point if and only if Φ is paradoxical (i.e., if and only if Φ receives the third, non-classical value on all fixed points that extend the current fixed point), and an unbounded truth operator Υ⊤ where Υ⊤(Φ) is true at a fixed point if and only if any fixed point extending the (...) current fixed point can be extended to one on which Φ receives the value true. We prove a generalized version of Kripke’s fixed point theorem guaranteeing the existence of models of this new language, as well as an expressive completeness result. We conclude with an exploration of the significant improvements in expressive power that result from the addition of these new operators, and we precisely identify what still cannot be said on this intensional extension of the Kripkean framework. (shrink)

In other works, I’ve proposed a solution to the semantic paradoxes which, at the technical level, basically relies on failure of contraction. I’ve also suggested that, at the philosophical level, contraction fails because of the instability of certain states of affairs. In this paper, I try to make good on that suggestion.

It is a fundamental intuition about truth that the conditions under which a sentence is true are given by what the sentence asserts. My aim in this paper is to show that this intuition captures the concept of truth completely and correctly. This is conceptual deflationism, for it does not go beyond what is asserted by a sentence in order to define the truth status of that sentence. This paper, hence, is a defense of deflationism as a conceptual account of (...) truth. This defense is developed in four stages. In the first stage I present a distinction between two types of deflationism, conceptual and metaphysical. This is the central stage of the argument and its main conclusion is that conceptual deflationism when joined with the principle of bivalence is inconsistent with metaphysical deflationism, that is, conceptual deflationism together with bivalence entails a non-deflationary metaphysical account of truth. In the second and third stages of the argument I argue that the totality of the Tarskian biconditionals, when interpreted as definitional biconditionals, offers a description of the nature of truth. In the fourth, and final, stage of the argument I advance a positive case for conceptual deflationism. I explain how the revision theory of truth provides this sort of deflationism with its best evidence: a clear demonstration of its consistency and a compelling argument for its material adequacy. (shrink)

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

According to Gupta and Belnap, the “extensional behavior” of ‘true’ matches that of a circularly defined predicate. Besides promising to explain semantic paradoxicality, their general theory of circular predicates significantly liberalizes the framework of truth-conditional semantics. The authors’ discussions of the rationale behind that liberalization invoke two distinct senses in which a circular predicate’s semantic behavior is explained by a “revision rule” carrying hypothetical information about its extension. Neither attempted explanation succeeds. Their theory may however be modified to employ a (...) relativized notion of extension. The resulting contextualist semantics for ‘true’ construes circularity as a pragmatic phenomenon. (shrink)

We develop an untyped framework for the multiverse of set theory. $\mathsf {ZF}$ is extended with semantically motivated axioms utilizing the new symbols $\mathsf {Uni}(\mathcal {U})$ and $\mathsf {Mod}(\mathcal {U, \sigma })$, expressing that $\mathcal {U}$ is a universe and that $\sigma $ is true in the universe $\mathcal {U}$, respectively. Here $\sigma $ ranges over the augmented language, leading to liar-style phenomena that are analyzed. The framework is both compatible with a broad range of multiverse conceptions and suggests its (...) own philosophically and semantically motivated multiverse principles. In particular, the framework is closely linked with a deductive rule of Necessitation expressing that the multiverse theory can only prove statements that it also proves to hold in all universes. We argue that this may be philosophically thought of as a Copernican principle that the background theory does not hold a privileged position over the theories of its internal universes. Our main mathematical result is a lemma encapsulating a technique for locally interpreting a wide variety of extensions of our basic framework in more familiar theories. We apply this to show, for a range of such semantically motivated extensions, that their consistency strength is at most slightly above that of the base theory $\mathsf {ZF}$, and thus not seriously limiting to the diversity of the set-theoretic multiverse. We end with case studies applying the framework to two multiverse conceptions of set theory: arithmetic absoluteness and Joel D. Hamkins’ multiverse theory. (shrink)

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.

We sketch a broadening of the Gupta-Belnap notion of a circular or revision theoretic definition into that of a more generalized form incorporating ideas of Kleene’s generalized or higher type recursion. This thereby connects the philosophically motivated, and derived, notion of a circular definition with an older form of definition by recursion using functionals, that is functions of functions, as oracles. We note that Gupta and Belnap’s notion of ‘categorical in L’ can be formulated in at least one of these (...) schemes. (shrink)

This thesis comprises three main chapters—each comprising one relatively standalone paper. The unifying theme is fragmentalism about truth, which is the view that the predicate “true” either expresses distinct concepts or expresses distinct properties. -/- In Chapter 1, I provide a formal development of alethic pluralism. Pluralism is the view that there are distinct truth properties associated with distinct domains of subject matter, where a truth property satisfies certain truth-characterizing principles. On behalf of pluralists, I propose an account of logic (...) and semantics that shows how they can answer central conceptual and logical challenges for their view. -/- In Chapter 2, I motivate and develop a modal account of propositions on the basis of an iterative conception of propositions, where the modality is logico-mathematical. The modal account of propositions takes the conception to motivate an inherently potential hierarchy of propositions. I show that the account helps provide satisfying solutions to the intensional paradoxes of Russell-Myhill, Kaplan, and Prior. -/- In Chapter 3, I propose that “true” is polysemous. I suggest that “true” is initially polysemous between correspondence truth and disquotational truth, and further polysemous between the meanings corresponding to the subconcepts of the concept truth generated by the indefinite extensibility of that concept. I show that the proposal provides satisfying solutions to the semantic paradoxes. (shrink)

According to the revision theory of truth, the paradoxical sentences have certain revision periods in their valuations with respect to the stages of revision sequences. We find that the revision periods play a key role in characterizing the degrees of paradoxicality for Boolean paradoxes. We prove that a Boolean paradox is paradoxical in a digraph, iff this digraph contains a closed walk whose height is not any revision period of this paradox. And for any finitely many numbers greater than 1, (...) if any of them is not divisible by any other, we can construct a Boolean paradox whose primary revision periods are just these numbers. Consequently, the degrees of Boolean paradoxes form an unbounded dense lattice. The area of Boolean paradoxes is proved to be rich in mathematical structures and properties. (shrink)

This volume is about abstract objects and the ways we refer to them in natural language. Asher develops a semantical and metaphysical analysis of these entities in two stages. The first reflects the rich ontology of abstract objects necessitated by the forms of language in which we think and speak. A second level of analysis maps the ontology of natural language metaphysics onto a sparser domain--a more systematic realm of abstract objects that are fully analyzed. This second level reflects the (...) commitments of real metaphysics. The models for these commitments assign truth conditions to natural language discourse. Annotation copyright by Book News, Inc., Portland, OR. (shrink)

Revision sequences were introduced in 1982 by Herzberger and Gupta as a mathematical tool in formalising their respective theories of truth. Since then, revision has developed in a method of analysis of theoretical concepts with several applications in other areas of logic and philosophy. Revision sequences are usually formalised as ordinal-length sequences of objects of some sort. A common idea of revision process is shared by all revision theories but specific proposals can differ in the so-called limit rule, namely the (...) way they handle the limit stages of the process. The limit rules proposed by Herzberger and by Belnap show different mathematical properties, called periodicity and reflexivity, respectively. In this paper we isolate a notion of cofinally dependent limit rule, encompassing both Herzberger’s and Belnap’s ones, to study periodicity and reflexivity in a common framework and to contrast them both from a philosophical and from a mathematical point of view. We establish the equivalence of weak versions of these properties with the revision-theoretic notion of recurring hypothesis and draw from this fact some observations about the problem of choosing the “right” limit rule when performing a revision-theoretic analysis. (shrink)

This paper provides a procedure which, from any Boolean system of sentences, outputs another Boolean system called the ‘_m_-cycle unwinding’ of the original Boolean system for any positive integer _m_. We prove that for all \(m>1\), this procedure eliminates the direct self-reference in that the _m_-cycle unwinding of any Boolean system must be indirectly self-referential. More importantly, this procedure can preserve the primary periods of Boolean paradoxes: whenever _m_ is relatively prime to all primary periods of a Boolean paradox, this (...) paradox and its _m_-cycle unwinding have the same primary periods. In this way, we can produce an indirectly self-referential Boolean paradox with the same periodic characteristics as a known Boolean paradox. (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)

We look at various notions of a class of definability operations that generalise inductive operations, and are characterised as “revision operations”. More particularly we: (i) characterise the revision theoretically definable subsets of a countable acceptable structure; (ii) show that the categorical truth set of Belnap and Gupta’s theory of truth over arithmetic using \emph{fully varied revision} sequences yields a complete \Pi13 set of integers; (iii) the set of \emph{stably categorical} sentences using their revision operator ψ is similarly \Pi13 and which (...) is complete in Gödel’s universe of constructible sets L; (iv) give an alternative account of a theory of truth—realistic variance that simplifies full variance, whilst at the same time arriving at Kripkean fixed points. (shrink)

In my “Deep Inconsistency”, I compared my meaning-inconsistency view on the liar with Graham Priest’s dialetheist view, using my view to help cast doubt on Priest’s arguments for his view. Jc Beall and Priest have recently published a reply to my article. I here respond to their criticisms. In addition, I compare the meaning–inconsistency view with Anil Gupta and Nuel Belnap’s revision theory of truth, and discuss how best to deal with the strengthened liar.

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}$.

We show that the set of ultimately true sentences in Hartry Field's Revenge-immune solution model to the semantic paradoxes is recursively isomorphic to the set of stably true sentences obtained in Hans Herzberger's revision sequence starting from the null hypothesis. We further remark that this shows that a substantial subsystem of second-order number theory is needed to establish the semantic values of sentences in Field's relative consistency proof of his theory over the ground model of the standard natural numbers: -CA0 (...) (second-order number theory with a -comprehension axiom scheme) is insufficient. We briefly consider his claim to have produced a solution to the semantic paradoxes by introducing this conditional. We remark that the notion of a operator can be introduced in other settings. (shrink)

According to the revision theory of truth, the binary sequences generated by the paradoxical sentences in revision sequence are always unstable. In this paper, we work backwards, trying to reconstruct the paradoxical sentences from some of their binary sequences. We give a general procedure of constructing paradoxes with specific binary sequences through some typical examples. Particularly, we construct what Herzberger called “unstable statements with unpredictably complicated variations in truth value.” Besides, we also construct those paradoxes with infinitely many finite primary (...) periods but without any infinite primary period, those with an infinite critical point but without any finite primary period, and so on. This is the first formal appearance of these paradoxes. Our construction demonstrates that the binary sequences generated by a paradoxical sentence are something like genes from which we can even rebuild the original sentence itself. (shrink)

A relativized version of Tarski's T-scheme is introduced as a new principle of the truth predicate. Under the relativized T-scheme, the paradoxical objects, such as the Liar sentence and Jourdain's card sequence, are found to have certain relative contradictoriness. That is, they are contradictory only in some frames in the sense that any valuation admissible for them in these frames will lead to a contradiction. It is proved that for any positive integer n, the n-jump liar sentence is contradictory in (...) and only in those frames containing at least an n-jump odd cycle. In particular, the Liar sentence is contradictory in and only in those frames containing at least an odd cycle. The Liar sentence is also proved to be less contradictory than Jourdain's card sequence: the latter must be contradictory in those frames where the former is so, but not vice versa. Generally, the relative contradictoriness is the common characteristic of the paradoxical objects, but different paradoxical objects may have different relative contradictoriness. (shrink)

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