I identify a notion of logical grounding, clarify it, and show how it can be used (i) to characterise various consequence relations, and (ii) to give a precise syntactic account of the notion of “groundedness” at work in the literature on the paradoxes of truth.

Truth values are, properly understood, merely proxies for the various relations that can hold between language and the world. Once truth values are understood in this way, consideration of the Liar paradox and the revenge problem shows that our language is indefinitely extensible, as is the class of truth values that statements of our language can take – in short, there is a proper class of such truth values. As a result, important and unexpected connections emerge between the semantic paradoxes (...) and the set-theoretic paradoxes. (shrink)

It is shown that the logical truth of instances of the T-schema is incompatible with the formal nature of logical truth. In particular, since the formality of logical truth entails that the set of logical truths is closed under substitution, the logical truth of T-schema instances entails that all sentences are logical truths.

The No-No Paradox consists of a pair of statements, each of which ?says? the other is false. Roy Sorensen claims that the No-No Paradox provides an example of a true statement that has no truthmaker: Given the relevant instances of the T-schema, one of the two statements comprising the ?paradox? must be true (and the other false), but symmetry constraints prevent us from determining which, and thus prevent there being a truthmaker grounding the relevant assignment of truth values. Sorensen's view (...) is mistaken: situated within an appropriate background theory of truth, the statements comprising the No-No Paradox are genuinely paradoxical in the same sense as is the Liar (and thus, on Sorensen's view, must fail to have truth values). This result has consequences beyond Sorensen's semantic framework. In particular, the No-No Paradox, properly understood, is not only a new paradox, but also provides us with a new type of paradox, one which depends upon a general background theory of the truth predicate in a way that the Liar Paradox and similar constructions do not. (shrink)

We extend the Embracing Revenge account of the semantic paradoxes by constructing two distinct consequence relations that reflect, in different ways, the transfinitely-many-valued semantics developed in earlier work. In particular, we adapt the underlying ideas of “gappy” approaches based on K3, and “glutty” approaches based on LP, to the Embracing Revenge framework, by treating the infinitely many non-classical truth values as infinitely many ways that a sentence might fail to receive a classical truth value in the former case, and as (...) infinitely many ways that a sentence might receive both classical truth values in the latter. In order to obtain deductive systems that are very nearly classical, we need to utilize different conditionals (and different negations) in each logic. (shrink)

In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke possible world semantics. This kind of modal system characterized by finite non-deterministic matrices was originally proposed by Ju. Ivlev in the 70s. The aim of this second paper is to introduce a formal non-deterministic semantical framework for the quantified versions of some Ivlev-like non-normal modal logics. It will be shown that several well-known controversial issues of (...) quantified modal logics, relative to the identity predicate, Barcan’s formulas and de re and de dicto modalities, can be tackled from a new angle within the present framework. (shrink)

There is an incompatibility between the deflationist approach to truth, which makes truth transparent on the basis of an antecedent grasp of meaning, and the traditional endeavour, exemplified by Davidson, to explicate meaning through of truth. I suggest that both parties are in the explanatory red: deflationist lack a non-truth-involving theory of meaning and Davidsonians lack a non-deflationary account of truth. My focus is on the attempts of the latter party to resolve their problem. I look in detail at Davidson's (...) more recent work and suggest that it seeks to articulate a primitive notion of truth that may balance between a notion that collapses into deflationism and one that is wholly subsumed under a general theory of interpretation. I conclude that this tightrope walk is ultimately unsuccessful. Equally, however, some reasons are provided for thinking that deflationism might be equally unsuccessful with its problem. 'Truth or meaning?' remains an open question. (shrink)

Dans la première partie de cet article, je presente une thèse parapluie — la thèse de l'«exhaustion» — qui cerne bien l'élément central des diverses positions déflationnistes au sujet de la vérité : l'idée que le contenu du prédicat de vérité s'épuise entièrement dans le contenu de ce à quoi le prédicats'applique. Je soutiens que cette thèse n'est supportée que d'une manière triviale par l'idée courante que la vérite résiste à une analyse substantielle, car les prédicats en général ne se (...) prêtent guere à ce genre d'analyse. J'examine ensuite deux élaborations positives de la thèse de l'exhaustion; et je soutiens que ni l'une ni l'autre ne commence même à montrer que la thèse en question soit explicativement adéquate. (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.

In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external logic and (...) argue that while ST+’s nonclassicality can be granted, its self-dual character does not tie it to LP+ more closely than to K3+. (shrink)

In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some of the three properties, namely subclassicality and two properties that we call fixed-point negation property (...) and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively. (shrink)

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.

Answering a question formulated by Halbach (2009), I show that a disquotational truth theory, which takes as axioms all positive substitutions of the sentential T-schema, together with all instances of induction in the language with the truth predicate, is conservative over its syntactical base.

This paper examines a puzzle about whether truth is a valuable property: Valuable properties, like beauty and moral goodness, come in degrees; but truth does not come in degrees. Hence, the argument concludes, truth is not valuable. This result is puzzling since it seems to conflict with a deep intuition that truth is valuable. It is suggested that a roughly Platonic theory, on which truth is distinguished into two different concepts, gives a satisfying answer to the puzzle. One of these (...) concepts can be had in degrees, which, it is suggested, may be determined by the true proposition's explanatory power. (shrink)

Two periods in the history of logic and philosophy are characterized notably by vivid interest in self-referential paradoxical sentences in general, and Liar sentences in particular: the later medieval period (roughly from the 12th to the 15th century) and the last 100 years. In this paper, I undertake a comparative taxonomy of these two traditions. I outline and discuss eight main approaches to Liar sentences in the medieval tradition, and compare them to the most influential modern approaches to such sentences. (...) I also emphasize the aspects of each tradition that find no counterpart in the other one. It is expected that such a comparison may point in new directions for future research on the paradoxes; indeed, the present analysis allows me to draw a few conclusions about the general nature of Liar sentences, and to identify aspects that would require further investigation. (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)

This article investigates models of axiomatizations related to the semantic conception of truth presented by Kripke (J Philos 72(19):690–716, 1975), the so-called _fixed-point semantics_. Among the various proof systems devised as a proof-theoretic characterization of the fixed-point semantics, in recent years two alternatives have received particular attention: _classical systems_ (i.e., systems based on classical logic) and _nonclassical systems_ (i.e., systems based on some nonclassical logic). The present article, building on Halbach and Nicolai (J Philos Log 47(2):227–257, 2018), shows that there (...) is a sense in which classical and nonclassical theories (in suitable variants) have the same models. (shrink)

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

In this paper, we discuss a family of arguments that show the inconsistency of the concept of omniscience, which is one of the central attributes of the theistic God. We introduce three member of this family: Grim’s Divine Liar Paradox, Milne’s Paradox and our own Divine Curry. They can be seen as theological counterparts of well-known semantic paradoxes. We argue that the very simple dialetheist response to these paradoxes doesn’t work well and then introduce our own response based on a (...) framework that we call Logic of Impossible Truths. LIT is a non-dialetheist paraconsistent logic designed to represent divine ominiscience and to preserve the transparency of the truth predicate and which semantics rests on the concept of situation. Since some rules of classical logic are not valid in LIT, we are in a position to block the derivation of the paradoxes. Thus, LIT offers a way out of the dilemma of accepting that there are true contradictions or giving up the idea that there is an all-powerful, omniscient and perfectly good being. (shrink)

In this paper we intend to outline an introduction to Situation Theory as an approach to the liar paradoxes. This idea was first presented by the work of Barwise and Etchemendy ). First we introduce the paradoxes in their most appealing and important versions. Second we show that non-classical approaches on the problem usually get puzzled by the revenge problem on one side and loss of expressive power on the other side. Last, we present Situation Theory and try to show (...) how it is capable of solving the old paradoxes and blocking revenge. The price we pay on this view is universality, since it would allow a new revenge situated liar. We don’t intend to address the problem of universality here, but we try at least to motivate the reader to make sense of this theory. (shrink)

This paper contributes to the study of paracompleteness and paraconsistency. We present two logics that address the following questions in novel ways. How can the paracomplete theorist characterize the formulas that defy excluded middle while maintaining that not all formulas are of this kind? How can the paraconsistent theorist characterize the formulas that obey explosion while still maintaining that there are some formulas not of this kind?

This note motivates a logic for a theory that can express its own notion of logical consequence—a ‘syntactically closed’ theory of naive validity. The main issue for such a logic is Curry’s paradox, which is averted by the failure of contraction. The logic features two related, but different, implication connectives. A Hilbert system is proposed that is complete and non-trivial.

Metaphilosophy, Volume 53, Issue 2-3, Page 221-237, April 2022.

The aim of this paper is to introduce a formal system STW of self-referential truth, which extends the classical first-order theory of pure combinators with a truth predicate and certain approximation axioms. STW naturally embodies the mechanisms of general predicate application/abstraction on a par with function application/abstraction; in addition, it allows non-trivial constructions, inspired by generalized recursion theory. As a consequence, STW provides a smooth inner model for Myhill's systems with levels of implication.

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.

We introduce a notion of semantical closure for theories by formalizing Nepeivoda notion of truth. [10]. Tarski theorem on truth definitions is discussed in the light of Kleene's three valued logic (here treated with a formal reinterpretation of logical constants). Connections with Definability Theory are also established.

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)

'Chains of Being' argues that there can be infinite chains of dependence or grounding. Cameron also defends the view that there can be circular relations of ontological dependence or grounding, and uses these claims to explore issues in logic and ontology.

Probabilism is the view that a rational agent's credences should always be probabilistically coherent. It has been argued that Probabilism follows, given the assumption that an epistemically rational agent ought to try to have credences that represent the world as accurately as possible. The key claim in this argument is that the goal of representing the world as accurately as possible is best served by having credences that are probabilistically coherent. This essay shows that this claim is false. In certain (...) cases, the goal of having accurate credences is best served by being probabilistically incoherent. Assuming that an epistemically rational agent ought to try to have credences that are as accurate as possible, it follows that in certain cases a rational agent ought to have probabilistically incoherent credences. (shrink)

It is well known that the following features hold of AR + T under the strong Kleene scheme, regardless of the way the language is Gödel numbered: 1. There exist sentences that are neither paradoxical nor grounded. 2. There are 2ℵ0 fixed points. 3. In the minimal fixed point the weakly definable sets (i.e., sets definable as {n∣ A(n) is true in the minimal fixed point where A(x) is a formula of AR + T) are precisely the Π1 1 sets. (...) 4. In the minimal fixed point the totally defined sets (sets weakly defined by formulae all of whose instances are true or false) are precisely the ▵1 1 sets. 5. The closure ordinal for Kripke's construction of the minimal fixed point is ωCK 1. In contrast, we show that under the weak Kleene scheme, depending on the way the Gödel numbering is chosen: 1. There may or may not exist nonparadoxical, ungrounded sentences. 2. The number of fixed points may be any positive finite number, ℵ0, or 2ℵ0 . 3. In the minimal fixed point, the sets that are weakly definable may range from a subclass of the sets 1-1 reducible to the truth set of AR to the Π1 1 sets, including intermediate cases. 4. Similarly, the totally definable sets in the minimal fixed point range from precisely the arithmetical sets up to precisely the ▵1 1 sets. 5. The closure ordinal for the construction of the minimal fixed point may be ω, ωCK 1, or any successor limit ordinal in between. In addition we suggest how one may supplement AR + T with a function symbol interpreted by a certain primitive recursive function so that, irrespective of the choice of the Godel numbering, the resulting language based on the weak Kleene scheme has the five features noted above for the strong Kleene language. (shrink)

An attractive approach to the semantic paradoxes holds that cases of semantic pathology give rise to indeterminacy. What attitude should a rational agent have toward a proposition that it takes to be indeterminate in this sense? Orthodoxy holds that rationality requires that an agent disbelieve such a proposition. I argue that a rational agent should be such that it is indeterminate whether it believes the proposition in question. For rational agents, indeterminacy in the objects of their attitudes will filter up (...) to the attitudes themselves. (shrink)

Systems ofillative logicare logical calculi formulated in the untypedλ-calculus supplemented with certain logical constants.1In this short paper, I consider a paradox that arises in illative logic. I note two prima facie attractive ways of resolving the paradox. The first is well known to be consistent, and I briefly outline a now standard construction used by Scott and Aczel that establishes this. The second, however, has been thought to be inconsistent. I show that this isn’t so, by providing a nonempty class (...) of models that establishes its consistency. I then provide an illative logic which is sound and complete for this class of models. I close by briefly noting some attractive features of the second resolution of this paradox. (shrink)

Plausible principles on truth seem to yield contradictory conclusions about paradoxical sentences such as the Strengthened Liar. Those who take the contextualist approach, such as Parsons and Burge, attempt to justify the seemingly contradictory conclusions by arguing that the natural reasoning that leads to them involves some kind of contextual shift that makes them compatible. This paper argues that one cannot take this approach to give a proper treatment of infinite descending chains of semantic attributions. It also examines a related (...) approach taken by Gaifman and argues that it has the same problem. (shrink)

The complexity of the set of truths of arithmetic is determined for various theories of truth deriving from Kripke and from Gupta and Herzberger.

One thousand stones, suitably arranged, might form a heap. If we remove a single stone from a heap of stones we still have a heap; at no point will the removal of just one stone make sufficient difference to transform a heap into something which is not a heap. But, if this is so, we still have a heap, even when we have removed the last stone composing our original structure. So runs the Sorites paradox. Similar paradoxes can be constructed (...) with any predicate which, like 'heap', displays borderline vagueness. Although I have frequently heard it said that there is no completely credible and satisfying dissolution of the paradoxes of the Sorites family; and although there is no possible approach to dissolution which has not been at least partially explored, philosophers continue glibly to use vague language as though it were entirely unproblematic. Since no argument has ever been produced which would justify our ignoring the para~doxes, this situation is extremely unsatisfactory. (shrink)

Suppose our ordinary notion of truth is ‘inconsistent’ in the sense that its meaning is partly given by principles that classically entail a logical contradiction. Should we replace the notion with a consistent surrogate? This paper begins by defusing various arguments in favor of this revisionary proposal, including Kevin Scharp’s contention that we need to replace truth for the purposes of semantic theorizing . Borrowing a certain conservative metasemantic principle from Matti Eklund, the article goes on to build a positive (...) case for the opposite policy: retaining truth as-is. The thought is basically that bivalence for the bulk of what we say in the course of ordinary, scientific, and philosophical inquiry should suffice to justify keeping ‘true’. Two versions of the story are told: one more philosophical, drawing on an analogy to Lewis’ response to Putnam’s paradox; the other more technical, invoking a deviant stran.. (shrink)

Grelling's Paradox is the paradox which results from considering whether heterologicality, the word-property which a designator has when and only when the designator does not bear the word-property it designates, is had by 'heterologicality'. Although there has been some philosophical debate over its solution, Grelling's Paradox is nearly uniformly treated as a variant of either the Liar Paradox or Russell's Paradox, a paradox which does not present any philosophical challenges not already presented by the two better known paradoxes. The aims (...) of this paper are, first, to offer a precise formulation of Grelling's Paradox which is clearly distinguished from both the Liar Paradox and Russell's Paradox; second, to offer a solution to Grelling's Paradox which both resolves the paradoxical reasoning and accounts for unproblematic predications of heterologicality; and, third, to argue that there are two lessons to be drawn from Grelling's Paradox which have not yet been drawn from the Liar or Russell's Paradox. The first lesson is that it is possible for the semantic content of a predicate to be sensitive to the semantic context; i.e., it is possible for a predicate to be an indexical expression. The second lesson is that the semantic content of an indexical predicate, though unproblematic for many cases, can nevertheless be problematic in some cases. In Section 1, Grelling's Paradox is presented informally. After making some refinements, Grelling's Paradox is then presented formally. In Section 2, the formal version of Grelling's Paradox is evaluated, and several previously proposed solutions are discussed and argued to be inadequate. In Section 3, it is argued that the heterologicality predicate is an indexical expression. A semantics for the heterologicality predicate is given, and it is shown how this semantics accounts for the unproblematic predications of heterologicality, as well as the problematic cases, and therefore constitutes a satisfactory and complete solution to Grelling's Paradox. Objections to this solution are addressed in Section 4. The conclusions of this paper are summarized in Section 5. (shrink)

Semantic and soritical paradoxes display remarkable family resemblances. For one thing, several non-classical logics have been independently applied to both kinds of paradoxes. For another, revenge paradoxes and higher-order vagueness—among the most serious problems targeting solutions to semantic and soritical paradoxes—exhibit a rather similar dynamics. Some authors have taken these facts to suggest that truth and vagueness require a unified logical framework, or perhaps that the truth predicate is itself vague. However, a common core of semantic and soritical paradoxes has (...) not been identified yet, and no explanation of their relationships has been provided. Here we aim at filling this lacuna, in the framework of many-valued logics. We provide a unified diagnosis of semantic and soritical paradoxes, identifying their source in a general form of indiscernibility. We then develop our diagnosis into a theory of paradoxicality, which formalizes both semantic and soritical paradoxes as arguments involving specific instances of our generalized indiscernibility principle, and correctly predicts which logics can non-trivially solve them. (shrink)

Intuitively, vagueness involves some sort of indeterminacy: if Plato is a borderline case of baldness, then there is no fact of the matter about whether or not he’s bald—he’s neither bald nor not bald. The leading formal treatments of such indeterminacy—three valued logic, supervaluationism, etc.—either fail to validate the classical theorems, or require that various classically valid inference rules be restricted. Here we show how a fully classical, yet indeterminist account of vagueness can be given within natural semantics, an alternative (...) semantics for classical proof theory. The key features of the account are: there is a single notion of truth—definite truth—and a single notion of validity; sentences can be true, false, or undetermined; all classical theorems and all classical inference rule are valid; the sorites argument is unsound; ‘definitely’ is treated as a meta-language predicate; higher-order vagueness is handled via semantic ascent. (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)

Since universal language systems are confronted with serious paradoxical consequences, a semantic approach is developed in whichpartial worlds form the ontological basis. This approach shares withsituation semantics the basic idea that statements always refer to certain partial worlds, and it agrees with the extensional and model-theoretic character ofpossible worlds semantics. Within the framework of the partial worlds conception a satisfactory solution to theLiar paradox can be formulated. In particular, one advantage of this approach over those theories that are based on (...) the totality of possible worlds semantics can be found in the fact that the so-called Strengthened Liar problem is avoided. (shrink)