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)

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)

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 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)

Saul Kripke’s theory of truth suffers from expressive limitations – in particular, there are no extensional operators within that framework that allow one to characterize those sentences that fail to receive a truth value within the framework. Especially worrisome is the fact that there is no operator that outputs true on exactly the paradoxical sentences. In this paper I extend Kripke’s approach via the addition of extensional operators, which allows us to characterize many (but not all) such sentences, including the (...) paradoxical ones. (shrink)

$${{{\mathcal {F}}}}$$ -systems are useful digraphs to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and the one of Yablo can be analyzed with that tool to find graph-theoretic patterns. In this paper we studied this general model consisting of a set of sentences and the binary relation ‘ $$\ldots $$ affirms the falsity of $$\ldots $$ ’ among them. The possible existence of non-referential sentences was also considered. To model the sets of all the (...) sentences that can jointly be valued as true we introduced the notion of conglomerate, the existence of which guarantees the absence of paradox. Conglomerates also enabled us to characterize referential contradictions, i.e., sentences that can only be false under a classical valuation due to the interactions with other sentences in the model. A Kripke-style fixed-point characterization of groundedness was offered, and complete (meaning that every sentence is deemed either true or false) and consistent (meaning that no sentence is deemed true and false) fixed points were put in correspondence with conglomerates. Furthermore, argumentation frameworks are special cases of $$\mathcal{F}$$ -systems. We showed the relation between local conglomerates and admissible sets of arguments and argued about the usefulness of the concept for the argumentation theory. (shrink)