In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...) be identified with an infinite sequence of consequence relations holding between increasingly complex relata: formulae, inferences, metainferences, and so on. As a result, the present proposal allows not only to differentiate Classical Logic from ST, but also from other systems sharing with it their valid metainferences. Finally, we show how these results have interesting consequences for some topics in the philosophical logic literature, among them for the debate around Logical Pluralism. The reason being that the discussion concerning this topic is usually carried out employing a rivalry criterion for logics that will need to be modified in light of the present investigation, according to which two logics can be non-identical even if they share the same valid inferences. (shrink)

Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a logic is (...) paraconsistent if it invalidates either the inferential or the meta-inferential notion of Explosion. We show the non-triviality of this criterion by discussing a number of logics. On the one hand, logics which validate and invalidate both versions of Explosion, such as classical logic and Asenjo–Priest’s 3-valued logic LP. On the other hand, logics which validate one version of Explosion but not the other, such as the substructural logics TS and ST, introduced by Malinowski and Cobreros, Egré, Ripley and van Rooij, which are obtained via Malinowski’s and Frankowski’s q- and p-matrices, respectively. (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)

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)

The aim of this article is to discuss the extent to which certain substructural logics are related through the phenomenon of duality. Roughly speaking, metainferences are inferences between collect...

In this paper we discuss the extent to which the very existence of substructural logics puts the Tarskian conception of logical systems in jeopardy. In order to do this, we highlight the importance of the presence of different levels of entailment in a given logic, looking not only at inferences between collections of formulae but also at inferences between collections of inferences—and more. We discuss appropriate refinements or modifications of the usual Tarskian identity criterion for logical systems, and propose an (...) alternative of our own. After that, we consider a number of objections to our account and evaluate a substantially different approach to the same problem. (shrink)

The aim of this article is to study the notion of derivability and its semantic counterpart in the context of non-transitive and non-reflexive substructural logics. For this purpose we focus on the study cases of the logics _S__T_ and _T__S_. In this respect, we show that this notion doesn’t coincide, in general, with a nowadays broadly used semantic approach towards metainferential validity: the notion of local validity. Following this, and building on some previous work by Humberstone, we prove that in (...) these systems derivability can be characterized in terms of a notion we call absolute global validity. However, arriving at these results doesn’t lead us to disregard local validity. First, because we discuss the conditions under which local, and also global validity, can be expected to coincide with derivability. Secondly, because we show how taking into account certain families of valuations can be useful to describe derivability for different calculi used to present _S__T_ and _T__S_. (shrink)

A wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula φ⁠, any complex formula in which φ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with multiple contaminating (...) values. In this paper, we consider the countably infinite family of multiple-conclusion consequence relations in which classical logic is enriched with one or more contaminating values whose behavior is determined by a linear ordering between them. We consider some motivations and applications for such systems and provide general characterizations for all consequence relations in this family. Finally, we provide sequent calculi for a pair of four-valued logics including two linearly ordered contaminating values before defining two-sided sequent calculi corresponding to each of the infinite family of many-valued logics studied in this paper. (shrink)

This paper discusses three relevant logics that obey Component Homogeneity - a principle that Goddard and Routley introduce in their project of a logic of significance. The paper establishes two main results. First, it establishes a general characterization result for two families of logic that obey Component Homogeneity - that is, we provide a set of necessary and sufficient conditions for their consequence relations. From this, we derive characterization results for S*fde, dS*fde, crossS*fde. Second, the paper establishes complete sequent calculi (...) for S*fde, dS*fde, crossS*fde. Among the other accomplishments of the paper, we generalize the semantics from Bochvar, Hallden, Deutsch and Daniels, we provide a general recipe to define containment logics, we explore the single-premise/single-conclusion fragment of S*fde, dS*fde, crossS*fdeand the connections between crossS*fde and the logic Eq of equality by Epstein. Also, we present S*fde as a relevant logic of meaninglessness that follows the main philosophical tenets of Goddard and Routley, and we briefly examine three further systems that are closely related to our main logics. Finally, we discuss Routley's criticism to containment logic in light of our results, and overview some open issues. (shrink)

In this paper we discuss the extent to which conjunction and disjunction can be rightfully regarded as such, in the context of infectious logics. Infectious logics are peculiar many-valued logics whose underlying algebra has an absorbing or infectious element, which is assigned to a compound formula whenever it is assigned to one of its components. To discuss these matters, we review the philosophical motivations for infectious logics due to Bochvar, Halldén, Fitting, Ferguson and Beall, noticing that none of them discusses (...) our main question. This is why we finally turn to the analysis of the truth-conditions for conjunction and disjunction in infectious logics, employing the framework of plurivalent logics, as discussed by Priest. In doing so, we arrive at the interesting conclusion that —in the context of infectious logics— conjunction is conjunction, whereas disjunction is not disjunction. (shrink)

When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into Logical Monism. In this paper we show that the arguments usually employed to arrive at this conclusion do not work. The main reason for this is the existence of certain substructural logics which have the same set of valid inferences as Classical Logic—although they are, in a clear (...) sense, non-identical to it. We argue that this phenomenon can be generalized, given the existence of logics which coincide with Classical Logic regarding a number of metainferential levels—although they are, again, clearly different systems. We claim this highlights the need to arrive at a more refined version of the Collapse Argument, which we discuss at the end of the paper. (shrink)

In this article we revisit a number of disputes regarding significance logics---i.e., inferential frameworks capable of handling meaningless, although grammatical, sentences---that took place in a series of articles most of which appeared in the Australasian Journal of Philosophy between 1966 and 1978. These debates concern (i) the way in which logical consequence ought to be approached in the context of a significance logic, and (ii) the way in which the logical vocabulary has to be modified (either by restricting some notions, (...) or by adding some vocabulary) to keep as much of Classical Logic as possible. Our aim is to show that the divisions arising from these disputes can be dissolved in the context of a novel and intuitive proposal that we put forward. (shrink)

This paper extends Fitting's epistemic interpretation of some Kleene logics, to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting's "cut-down" operator is discussed, rendering a "track-down" operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in this track-down fashion. Finally, further reflections (...) on conjunction and disjunction in the weak Kleene logics accompany this paper, particularly concerning their relation with containment logics. These considerations motivate a special approach to defining sound and complete Gentzen-style sequent calculi for some of their four-valued generalizations. (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)

This article is concerned with an exploration of a family of systems—called immune logics—that arise from certain dualizations of the well-known family of infectious logics. The distinctive feature of the semantic of infectious logics is the presence of a certain “infectious” semantic value, by which two different though equivalent things are meant. On the one hand, it is meant that these values are zero elements for all the operations in the underlying algebraic structure. On the other hand, it is meant (...) that these values behave in a value-in-value-out fashion for all the operations in the underlying algebraic structure. Thus, in a rather informal manner, we will refer to immune logics as those systems whose underlying semantics count with a certain “immune” semantic value behaving in a way that is somewhat dual to that of the infectious values. In a more formal manner, carrying out this dualization will prove to be not as straightforward as one could imagine, since the two characterizations of infectiousness discussed above lead to two different outcomes when one tries to conduct them. We explore these alternatives and provide technical results regarding them, and the various logical systems defined using such semantics. (shrink)

We provide a logical matrix semantics and a Gentzen-style sequent calculus for the first-degree entailments valid in W. T. Parry’s logic of Analytic Implication. We achieve the former by introducing a logical matrix closely related to that inducing paracomplete weak Kleene logic, and the latter by presenting a calculus where the initial sequents and the left and right rules for negation are subject to linguistic constraints.

The aim of this article is to discuss pure variable inclusion logics, that is, logical systems where valid entailments require that the propositional variables occurring in the conclusion are included among those appearing in the premises, or vice versa. We study the subsystems of Classical Logic satisfying these requirements and assess the extent to which it is possible to characterise them by means of a single logical matrix. In addition, we semantically describe both of these companions to Classical Logic in (...) terms of appropriate matrix bundles and as semilattice-based logics, showing that the notion of consequence in these logics can be interpreted in terms of truth (or non-falsity) and meaningfulness (or meaninglessness) preservation. Finally, we use Płonka sums of matrices to investigate the pure variable inclusion companions of an arbitrary finitary logic. -/- . (shrink)

Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (iii) (...) that it is hybrid, insofar as it includes both left and right operational introduction as well as elimination rules. (shrink)

We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics is defined (...) in terms of a \-matrix built on top of a 5-valued extension of the 3-element weak Kleene algebra, whereas the calculus is defined in terms of a Gentzen-style sequent system where the left and right negation rules are subject to linguistic constraints. (shrink)

In Kripke’s classic paper on truth it is argued that by adding a new semantic category different from truth and falsity it is possible to have a language with its own truth predicate. A substantial problem with this approach is that it lacks the expressive resources to characterize those sentences which fall under the new category. The main goal of this paper is to offer a refinement of Kripke’s approach in which this difficulty does not arise. We tackle this characterization (...) problem by letting certain sentences belong to more than one semantic category. We also consider the prospect of generalizing this framework to deal with languages containing vague predicates. (shrink)

The present note revisits the joint work of Leonard Goddard and Richard Routley on significance logics with the aim of shedding new light on their understanding by studying them under the lens of recent semantic developments, such as the plurivalent semantics developed by Graham Priest. These semantics allow sentences to receive one, more than one, or no truth-value at all from a given carrier set. Since nonsignificant sentences are taken to be neither true nor false, i.e. truth-value gaps, in this (...) essay we show that with the aid of plurivalent semantics it is possible to straightforwardly instantiate Goddard and Routley’s understanding of how the connectives should work within significance logics. (shrink)

In a recent work, Walter Carnielli and Abilio Rodrigues present an epistemically motivated interpretation of paraconsistent logic. In their view, when there is conflicting evidence with regard to a proposition A (i.e. when there is both evidence in favor of A and evidence in favor of ￢A) both A and ￢A should be accepted without thereby accepting any proposition B whatsoever. Hence, reasoning within their system intends to mirror, and thus, should be constrained by, the way in which we reason (...) about evidence. In this article we will thoroughly discuss their position and suggest some ways in which this project can be further developed. The aim of the paper is twofold. On the one hand, we will present some philosophical critiques to the specific epistemic interpretation of paraconsistent logic proposed by Carnielli & Rodrigues. First, we will contend that Carnielli & Rodrigues’s interpretation implies a thesis about what evidence rationally justifies to accept or believe, called Extreme Permissivism, which is controversial among epistemologists. Second, we will argue that what agents should do, from an epistemic point of view, when faced with conflicting evidence, is to suspend judgment. On the other hand, despite these criticisms we do not believe that the epistemological motivation put forward by Carnielli & Rodrigues is entirely wrong. In the last section, we offer an alternative way in which one might account for the epistemic rationality of accepting contradictions and, thus, for an epistemic understanding of paraconsistency, which leads us to discuss the notion of diachronic epistemic rationality. (shrink)

The aim of this article is to show that, just like in recent years Cobreros, Égré, Ripley and van Rooij provided a non-transitive counterpart of classical logic (meaning by this that all classically acceptable inferences are valid, but Cut and other metainferences are not) the same can be done for every Tarskian logic, with full generality. In order to establish this fact, we take a semantic approach, by showing that appropriate structures can be devised to characterize a non-transitive counterpart of (...) every Tarskian logic, starting from the logical matrices that are usually taken to render them. (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which (...) the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)

This paper discusses a dualization of Fitting's notion of a "cut-down" operation on a bilattice, rendering a "track-down" operation, later used to represent the idea that a consistent opinion cannot arise from a set including an inconsistent opinion. The logic of track-down operations on bilattices is proved equivalent to the logic d_Sfde, dual to Deutsch's system S_fde. Furthermore, track-down operations are employed to provide an epistemic interpretation for paraconsistent weak Kleene logic. Finally, two logics of sequential combinations of cut-and track-down (...) operations allow settling positively the question of whether bilattice-based semantics are available for subsystems of S_fde. (shrink)

Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of a (...) flaw. However, since different programs and machines can interact with (or be nested into) one another, we need to account for different kind of errors, and this calls for an evaluation of systems with multiple contaminating values. In this paper, we make steps toward these evaluation systems by considering two logics, HYB1 and HYB2, whose semantic interpretations account for two contaminating values beside classical values 0 and 1. In particular, we provide two main formal contributions. First, we give a characterization of their relations of (multiple-conclusion) logical consequence—that is, necessary and sufficient conditions for a set Δ of formulas to logically follow from a set Γ of formulas in HYB1 or HYB2 . Second, we provide sound and complete sequent calculi for the two logics. (shrink)

In the literature, Weak Kleene logics are usually taken as three-valued logics. However, Suszko has challenged the main idea of many-valued logic claiming that every logic can be presented in a two-valued fashion. In this paper, we provide two-valued semantics for the Weak Kleene logics and for a number of four-valued subsystems of them. We do the same for the so-called Logics of Nonsense, which are extensions of the Weak Kleene logics with unary operators that allow looking at them as (...) Logics of Formal Inconsistency and Logics of Formal Underterminedness. Our aim with this work, rather than arguing for Suszko’s thesis, is to show that two-valued presentations of these peculiar logics enlighten the non-standard behavior of their logical connectives. More specifically, the two-valued presentations of paraconsistent logics illustrate and clarify the disjunctive flavor of the conjunction, and dually, the two-valued presentations of paracomplete subsystems of Weak Kleene logics reveal the conjunctive flavor of the disjunction. (shrink)

In one of their papers, Michael De and Hitoshi Omori observed that the notion of classical negation is not uniquely determined in the context of so-called Belnap-Dunn logic, and in fact there are 16 unary operations that qualify to be called classical negation. These varieties are due to different falsity conditions one may assume for classical negation. The aim of this paper is to observe that there is an interesting way to make sense of classical negation independent of falsity conditions. (...) We discuss two equivalent semantics, and offer a Hilbert-style system that is sound and complete with respect to the semantics. (shrink)

En este artículo propondremos, discutiremos y formalizaremos criterios gracias a los cuales podría legítimamente decirse que una inferencia o argumento es analítico o sintetico. Para ello, necesitaremos discutir la noción de asunto de una oración o fórmula, que será crucial en la determinación del carácter analítico o sintético de las inferencias. En el curso de dicha discusión, intentaremos mostrar que hay un interés filosófico en considerar semánticas para sistemas de lógica que admiten valores de verdad sin sentido, para lo cual (...) haremos uso esencial de dos sistemas de “Lógicas del Sinsentido” introducidos por Dimitri Bochvar y Sören Halldén, respectivamente. El interés de considerar sistemas con semánticas de este tipo reside en que, bajo ciertas condiciones, dichos sistemas podrán ser tenidos por analíticos, o sintéticos. (shrink)

Some recent researches in experimental philosophy have posed a problem for philosophers’ appeal to intuition (hereinafter referred to as PAI); the aim of this paper is to offer an answer to this challenge. The thesis against PAI implies that, given some experimental results, intuition does not seem to be a reliable epistemic source, and —more importantly— given the actual state of knowledge about its operation, we do not have sufficient resources to mitigate its errors and thus establish its reliability. That (...) is why PAI is hopeless. Throughout this paper I will defend my own conception of PAI, which I have called the Deliberative Conception, and consequently, I will defend intersubjective agreement as a means to mitigate PAI errors, offering empirical evidence from recent studies on the Argumentative Theory of Reason that favor the conception I defend here. Finally, I will reply to some objections that might arise against the Deliberative Conception, which will lead me to discuss some metaphilosophical issues that are significantly relevant for the future of the dispute about the appeal to intuition. (shrink)

In this article, we explore the semantic characterization of the (right) pure refined variable inclusion companion of all logics, which is a further refinement of the nowadays well-studied pure right variable inclusion logics. In particular, we will focus on giving a characterization of these fragments via a single logical matrix, when possible, and via a class of finite matrices, otherwise. In order to achieve this, we will rely on extending the semantics of the logics whose companions we will be discussing (...) with infectious values in direct and in more subtle ways. This further establishes the connection between infectious logics and variable inclusion logics. (shrink)

This paper provides an inferentialist motivation for a logic belonging in the connexive family, by borrowing elements from the bilateralist interpretation for Classical Logic without the Cut rule, proposed by David Ripley. The paper focuses on the relation between inferentialism and relevance, through the exploration of what we call relevant assertion and denial, showing that a connexive system emerges as a symptom of this interesting link. With the present attempt we hope to broaden the available interpretations for connexive logics, showing (...) they can be rightfully motivated in terms of certain relevantist constraints imposed on assertion and denial. (shrink)