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

Non‐classical logicians do not typically reject classically valid logical principles across the board. In fact, they sometimes suggest that their preferred logic recovers classical reasoning in most circumstances. This idea has come to be known in the literature as ‘classical recapture’. Recently, classical logicians have raised various doubts about it. The main problem is said to be that no rigorous explanation has been given of how is it exactly that classical logic can be recovered. The goal of the paper is (...) to address this problem. First, I discuss a number of different ways to characterize the idea of classical recapture and I examine how far it can be pushed. Secondly, I argue that a palatable form of classical recapture is given by the thought that classical logic can be retained for statements that are grounded (in Kripke’s sense). To substantiate this view I provide a formal fixed‐point semantics for a language containing a predicate standing for the concept of groundedness and I address a couple of objections that have been deployed against the claim that classical recapture can aid the non‐classical logician’s cause. (shrink)

Minimally inconsistent LP (MiLP) is a nonmonotonic paraconsistent logic based on Graham Priest's logic of paradox (LP). Unlike LP, MiLP purports to recover, in consistent situations, all of classical reasoning. The present paper conducts a proof-theoretic analysis of MiLP. I highlight certain properties of this logic, introduce a simple sequent system for it, and establish soundness and completeness results. In addition, I show how to use my proof system in response to a criticism of this logic put forward by JC (...) Beall. (shrink)

In the literature on self-referential paradoxes one of the hardest and most challenging problems is that of revenge. This problem can take many shapes, but, typically, it besets non-classical accounts of some semantic notion, such as truth, that depend on a set of classically defined meta-theoretic concepts, like validity, consistency, and so on. A particularly troubling form of revenge that has received a lot of attention lately involves the concept of validity. The difficulty lies in that the non-classical logician cannot (...) accept her own definition of validity because it is given in a classical meta-theory. It is often suggested that this mismatch between the consequence relation of the account being espoused and the consequence relation of the meta-theory is a serious embarrassment. The main goal of the paper is to explore whether certain substructural accounts of the paradoxes can avoid this sort of embarrassment. Typically, these accounts are expressively incomplete, since they cannot assert in the object language that certain invalid arguments are in fact invalid. To overcome this difficulty I develop a novel type of hybrid proof-procedure, one that takes invalidities to be just as fundamental as validities. I prove that this proof-procedure enjoys a number of interesting properties and I analyze the prospects of applying it to languages capable of expressing self-referential statements. (shrink)

It is not uncommon among theorists favoring a deviant logic on account of the semantic paradoxes to subscribe to an idea that has come to be known as ‘classical recapture’. The main thought underpinning it is that non-classical logicians are justified in endorsing many instances of the classically valid principles that they reject. Classical recapture promises to yield an appealing pair of views: one can attain naivety for semantic concepts while retaining classicality in ordinary domains such as mathematics. However, Julien (...) Murzi and Lorenzo Rossi have recently suggested that revisionary approaches to truth breed revenge paradoxes when they are coupled with the thought that classical reasoning can be recaptured in certain circumstances. What’s novel about the paradoxes they put forward is that they cannot be dismissed so easily. The concepts used to generate these paradoxes—those of paradoxicality and unparadoxicality—are concepts that non-classical theorists need in order to offer a diagnosis of the truth-theoretic paradoxes. My goal in this paper is to argue that non-classical theorists can represent the concept of paradoxicality without falling prey to revenge paradoxes. In particular, I will show how to provide a formal fixed-point semantics for a language extended with a paradoxicality predicate that adequately expresses the non-classical logician’s notion of paradoxicality. (shrink)

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

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

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

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)

It is often argued that fully structural theories of truth and related notions are incapable of expressing a nonstratified notion of defectiveness. We argue that recently much-discussed non-contractive theories suffer from the same expressive limitation, provided they identify the defective sentences with the sentences that yield triviality if they are assumed to satisfy structural contraction.

A lot has been written on solutions to the semantic paradoxes, but very little on the topic of general theories of paradoxicality. The reason for this, we believe, is that it is not easy to disentangle a solution to the paradoxes from a specific conception of what those paradoxes consist in. This paper goes some way towards remedying this situation. We first address the question of what one should expect from an account of paradoxicality. We then present one conception of (...) paradoxicality that has been offered in the literature: the fixed-point conception. According to this conception, a statement is paradoxical if it cannot obtain a classical truth-value at any fixed-point model. In order to assess this proposal rigorously we provide a non-metalinguistic characterization of paradoxicality and we evaluate whether the resulting account satisfies a number of reasonable desiderata. (shrink)

Thomas Hofweber takes the semantic paradoxes to motivate a radical reconceptualization of logical validity, rejecting the idea that an inference rule is valid just in case every instance thereof is necessarily truth-preserving. Rather than this “strict validity”, we should identify validity with “generic validity”, where a rule is generically valid just in case its instances are truth preserving, and where this last sentence is a generic, like “Bears are dangerous”. While sympathetic to Hofweber’s view that strict validity should be replaced (...) by something allowing for exceptions, I argue that this should instead be truth-conduciveness, a matter of a large majority of instances being truth-preserving. The fact that inference rules have uncountably many instances, I argue, can be handled by defining truth-conduciveness as relative to finite sets of instances. Moreover, I argue that Hofweber’s position, while seemingly radical, may be less so under closer scrutiny. For the mere claim that classical rules and unrestricted truth rules are generically valid (or truth-conducive) is not in itself controversial. Also, if there is an answer to the question of which of these are also strictly valid, then the claim that generic validity is the central notion in logic is at most an interest-relative matter, since there is then also a fact of the matter as to which inference rules are (not) strictly valid. If no solution operating with strict validity to the paradoxes can be had, however, then the claim that validity should be identified with a weaker notion is better motivated. I argue that it is reasonable, in view of past failures, to conjecture that no ordinary solution will score high enough relative to standard (uncontroversial) desiderata to merit justified belief. Hence, it is unknowable which solution is correct. I further argue that this is best explained by its being metaphysically indeterminate which solution is correct. If this conjecture is true, then we ought instead to think of validity as allowing exceptions, and then take the “true logic” to be one that takes both the classical rules and the truth rules to be valid, i.e., truth-conducive. This logic scores very high on the desiderata on logics, and is therefore preferable to any logic operating with strict validity. (shrink)

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

It is customarily assumed that paracomplete and paraconsistent solutions to liar paradoxes require a logical system weaker than classical logic. That is, if a logic is not fragile to liar paradoxes, it must be logically weaker than classical logic. Defenders of classical logic argue that the losses of weakening it outweigh the gains. Advocates of paracomplete and paraconsistent solutions disagree. We articulate the notion of fragility with respect to the liar paradox and show that it can be disentangled from logical (...) strength. Strength and resilience to paradox do not force a trade-off with respect to liars: there can be logics which are not weaker than classical logic and are solid to the liar. (shrink)

A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...) In this paper we tackle this expressive issue. We assume some background sentential language as given and define what we call an inferential language, that is, a language whose atomic formulas are inferences. We provide a model-theoretic characterization of validity for this language—relative to some given characterization of validity for the background sentential language—and provide a proof-theoretic analysis of validity. We argue that our novel language has fruitful philosophical applications. Lastly, we generalize some of our definitions and results to arbitrary metainferential levels. (shrink)

The Liar paradox arguably shows that a coherent and self-applicable notion of truth is governed by nonclassical logic. It then seems natural to conclude that classical logic is inadequate for defining a truth theory. In this article, we argue that this is not the case. In the spirit of Reinhardt (Math Logic Formal Syst 94:227, 1985; J Philos Logic 15:219–251, 1986), and in analogy with Hilbert’s program for the foundation of classical mathematics, we will articulate an instrumentalist justification for the (...) use classical logic: it will be argued that classical reasoning is a _useful but dispensable instrument_, which can yield philosophically adequate truth theories. (shrink)

Drawing on recently published correspondence as well as on a survey of Polish and international philosophical activity published in 1937 and details concerning the publisher and bookseller Aleksander Mazzucato, I provide evidence that, contrary to some recent assertions (but in line with older bibliographical entries), Tarski's ‘Der Wahrheitsbegriff in den formalisierten Sprachen’ was not published in journal form until 1936, although preprints, lacking two corrections and a small addendum, were likely available in the late months of 1935.

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)

The cut-free validity theory $$\textsf{STV}$$ proposed by Barrio, Rosenblatt, and Tajer suffers from incompleteness with respect to its object language validity predicate. The validity predicate of $$\textsf{STV}$$ fails in validating some valid inferences of its underlying logic, the Strict Tolerant logic $$\textsf{ST}$$. In this paper, we will present the non-normal modal logic $$\textsf{ST}^{\Box \Diamond }$$ whose modalities $$\Box $$ and $$\Diamond $$ capture the tautologies/valid inferences and the consistent formulas of the logic $$\textsf{ST}$$, respectively. We show that $$\textsf{ST}^{\Box \Diamond }$$ (...) does not trivialize when extended with self-referential devices. We also show that such a solution poses a dilemma. If we extend $$\textsf{ST}^{\Box \Diamond }$$ in such a way that it allows iterated modal formulas among its theorems, then the resulting interpretation of $$\Box $$ as validity implies that metametainferences of $$\textsf{ST}$$ behave like classical logic. On the other hand, if we allow these modalities to receive intermediate truth values, we obtain formulas incompatible with the proposed reading of $$\Box $$. (shrink)

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

The Liar sentence L, which reads ‘L is not true’, can be used to produce an apparently valid argument proving that L is not true and that L is true. There has been increasing recognition of the appeal of contextualist solutions to the Liar paradox. Contextualist accounts hold that some step in the reasoning induces a context shift that causes the apparently contradictory claims to occur at different contexts. Attempts at identifying the most promising contextualist account often rely on timing (...) arguments, which seek to isolate a step at which the context cannot be claimed to have shifted or must have shifted. The literature contains a number of timing arguments that draw incompatible conclusions about the location of the context shift. I argue that no existing timing arguments succeed. An alternative strategy for assessing contextualist accounts evaluates the plausibility of their explanations of why the context shifts. However, even this strategy yields no clear verdict about which contextualist account is the most promising. I conclude that there are some grounds for optimism and for pessimism about the potential to adequately motivate contextualism. (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)

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)