Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at least (...) some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)

In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...) involving semantic notions. In this article we intend to meet the challenge of answering how to regain all the safe instances of Cut, in the language of the theory, making essential use of a unary recovery operator. To fulfill this goal, we will work within the so-called Goodship Project, which suggests that in order to have nontrivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this article is to propose a novel way to carry this project out, showing that the biconditionals in question can be totally classical. In the context of this article, these biconditionals will be essentially used in expressing the self-referential sentences and, thus, as a collateral result of our work we will prove that none of the recoveries expected of the target theory can be nontrivially achieved if self-reference is expressed through identities. (shrink)

In this paper, we present a non-trivial and expressively complete paraconsistent naïve theory of truth, as a step in the route towards semantic closure. We achieve this goal by expressing self-reference with a weak procedure, that uses equivalences between expressions of the language, as opposed to a strong procedure, that uses identities. Finally, we make some remarks regarding the sense in which the theory of truth discussed has a property closely related to functional completeness, and we present a sound and (...) complete three-sided sequent calculus for this expressively rich theory. (shrink)

The first half of this article is critical: it develops an interpretation of Kant as trying, and failing, to limit our judgments to phenomena and abstain from making claims about noumena, and an interpretation of Wittgenstein as trying, and failing, to develop a theory of meaning that abstains from attempting to say the unsayable. On the reading offered, both Kant and Wittgenstein find themselves saying things that by their own lights cannot be said: in Kant’s case, claims about noumena, and (...) in Wittgenstein’s case, structural claims. While Kant attempts a solution of the problem which also fails, Wittgenstein bites the bullet and leaves his Tractatus, for the most part, void and meaningless. The suggested response is a dialetheic approach—either as an alternative or, potentially, as an amendment to a Kantian or Wittgensteinian theory. According to this approach, certain problems in philosophy arise from true contradictions and thus require a theory that makes sense of contradiction. A subgroup of these problems (among them the noumenal and structural issues in Kant and Wittgenstein) are about things that both are and are not ineffable. The second half of the paper develops a dialetheic account of ineffability and a concise formal theory to ensure that contradiction at the limits of language does not spread to other areas. (shrink)

This paper argues that inference rule adoption is a diachronic process during which agents are inferentially guided by a statement of the rule they are adopting, but during which they do not use that rule. Rather, the ability to use the rule is the outcome at the end of the process. This account avoids a regress objection to inferentially guided adoption recently posed by Boghossian and Wright. Adoption, on this model, involves the use of six privileged inference rules, including universal (...) instantiation, modus ponens, and the naive truth rules. However, though these rules play a special role in adoption, they are not indispensable to the process in their full generality: so long as one has reasonably robust restrictions of them, the adoption process is unimpeded. Furthermore, there are no general forms that constitute the minimal restrictions of these rules required for adoption. It follows that these rules, in their fully generality, are themselves adoptable, so long as one begins with reasonable restrictions of them. It is argued that this is enough to overcome the ‘adoption problem’ as a challenge to anti-exceptionalism about logic and to the normative significance of proposals for alternative logics. (shrink)

A dialetheia is a sentence, A, such that both it and its negation, A, are true (we shall talk of sentences throughout this entry; but one could run the definition in terms of propositions, statements, or whatever one takes as her favourite truth bearer: this would make little difference in the context). Assuming the fairly uncontroversial view that falsity just is the truth of negation, it can equally be claimed that a dialetheia is a sentence which is both true and (...) false. (shrink)

Weakening classical logic is one of the most popular ways of dealing with semantic paradoxes. Their advocates often claim that such weakening does not affect non-semantic reasoning. Recently, however, Halbach and Horsten have shown that this is actually not the case for Kripke’s fixed-point theory based on the Strong Kleene evaluation scheme. Feferman’s axiomatization $\textsf{KF}$ in classical logic is much stronger than its paracomplete counterpart $\textsf{PKF}$, not only in terms of semantic but also in arithmetical content. This paper compares the (...) proof-theoretic strength of an axiomatization of Kripke’s construction based on the paraconsistent evaluation scheme of $\textsf{LP}$, formulated in classical logic with that of an axiomatization directly formulated in $\textsf{LP}$, extended with a consistency operator. The ultimate goal is to find out whether paraconsistent solutions to the paradoxes that employ consistency operators fare better in this respect than paracomplete ones. (shrink)

In order to reason in a non-trivializing way with contradictions, para- consistent logics reject some classically valid inferences. As a way of re- covering some of these inferences, Graham Priest ([Priest, 1991]) proposed to nonmonotonically strengthen the Logic of Paradox by allowing the se- lection of “less inconsistent” models via a comparison of their respective inconsistent parts. This move recaptures a good portion of classical logic in that it does not block, e.g., disjunctive syllogism, unless it is applied to contradictory (...) assumptions. In Priest’s approach the inconsistent parts of models are compared in an extensional way by considering their inconsis- tent objects. This distinguishes his system from the standard format of (inconsistency-)adaptive logics pioneered by Diderik Batens, according to which (atomic) contradictions validated in models form the basis of their comparison. A well-known problem for Priest’s extensional approach is its lack of the Strong Reassurance property, i.e., for specific settings there may be infinitely descending chains of less and less inconsistent models, thus never reaching a minimally inconsistent model. In this paper, we demonstrate that Strong Reassurance holds for the extensional approach under a cardinality-based comparison of the incon- sistent parts of models. Furthermore, we introduce and investigate the metatheory of the class of first-order nonmonotonic inconsistency-tolerant construct over the extensional or quantitative comparisons of their respec- tive models. Core model-theoretic properties for these logics, such as the Löwenheim-Skolem theorems, along with other nonmonotonic properties, are further studied. (shrink)

This paper is a step toward showing what is achievable using non-classical metatheory—particularly, a substructural paraconsistent framework. What standard results, or analogues thereof, from the classical metatheory of first order logic can be obtained? We reconstruct some of the originals proofs for Completeness, Löwenheim-Skolem and Compactness theorems in the context of a substructural logic with the naive comprehension schema. The main result is that paraconsistent metatheory can ‘re-capture’ versions of standard theorems, given suitable restrictions and background assumptions; but the shift (...) to non-classical logic may recast the meanings of these apparently ‘absolute’ theorems. (shrink)

This paper concerns two paradoxes involving propositions. The first is Russell's paradox from Appendix B of The Principles of Mathematics, a version of which was later given by Myhill. The second is a paradox in the framework of possible worlds, given by Kaplan. This paper shows a number of things about these paradoxes. First, we will see that, though the Russell/myhill paradox and the Kaplan paradox might appear somewhat different, they are really just variants of the same phenomenon. Though they (...) do this in different ways, the core of each paradox is to use the notion of a proposition to construct a function, f, from the power set of some set into the set itself. Next we will see how this paradox fits into the Inclosure Schema. Finally, I will provide a model of the paradox in question, showing its results to be non‐trivial, though inconsistent. (shrink)

Thought: A Journal of Philosophy, EarlyView.

Dialetheists concerning the paradoxes of self-refrence have often argued that the phenomeonon provides a choice between inconsistency and expressive incompleteness, and that inconsistency is the correct choice. In a recent paper 75: 573-84), JC Beall attacks this argument. This paper analyses his arguments, and argues that his paper simply provides a new spin on matters well known.

Priest, argues that classical reasoning can be made compatible with his preferred logical theory by proposing a methodological maxim authorizing the use of classical logic in consistent situations. Although Priest has abandoned this proposal in favour of the one in G. Priest, I shall argue that due to the fact that the derivability adjustment theorem holds for several logics of formal consistency, these paraconsistent logics are particularly well suited to accommodate classical reasoning by means of a version of that maxim, (...) yielding thus an enthymematic account of classical recapture. (shrink)

One of the oldest systems of paraconsistent logic is the set of so-called C-systems of Newton da Costa, and this has been generalized into a family of systems now known as logics of formal inconsistencies by Walter Carnielli, Marcelo Coniglio and João Marcos. The characteristic notion in these systems is the so-called consistency operator which, roughly speaking, indicates how gluts are behaving. One natural question then is to ask if we can let not only gluts but also gaps be around (...) and generalize the notion of consistency into classicality. This is already considered by Andréa Loparić and da Costa in the style of C-systems. The aim of this paper is to develop a family of systems that generalizes the system of Loparić and da Costa which may be called logics of formal classicality. (shrink)