In this paper, first, we determine the number of sublogics of variable inclusion of an arbitrary finitary logic ⊢ with a composition term. Then, we investigate their position into the lattice of co...

Paraconsistent Weak Kleene Logic is the 3-valued propositional logic defined on the weak Kleene tables and with two designated values. Most of the existing proof systems for PWK are characterised by the presence of linguistic restrictions on some of their rules. This feature can be seen as a shortcoming. We provide a cut-free calculus for PWK that is devoid of such provisos. Moreover, we introduce a Priest-style tableaux calculus for PWK.

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)

Paraconsistent weak Kleene logic is the $3$-valued logic based on the weak Kleene matrices and with two designated values. In this paper, we investigate the poset of prevarieties of generalized involutive bisemilattices, focussing in particular on the order ideal generated by Α$\textrm{lg} $. Applying to this poset a general result by Alexej Pynko, we prove that, exactly like Priest’s logic of paradox, $\textrm{PWK}$ has only one proper nontrivial extension apart from classical logic: $\textrm{PWK}_{\textrm{E}}\textrm{,}$ PWK logic plus explosion. This $6$-valued logic, (...) unlike $\textrm{PWK} $, fails to be paraconsistent. We describe its consequence relation via a variable inclusion criterion and identify its Suszko-reduced models. (shrink)

The logic DAI of demodalised analytic implication has been introduced by J.M. Dunn as a variation on a time-honoured logical system by C.I. Lewis’ student W.T. Parry. The main tenet underlying this logic is that no implication can be valid unless its consequent is “analytically contained” in its antecedent. DAI has been investigated both proof-theoretically and model-theoretically, but no study so far has focussed on DAI from the viewpoint of abstract algebraic logic. We provide several different algebraic semantics for DAI, (...) showing their equivalence with the known semantics by Dunn and Epstein. We also show that DAI is algebraisable and we identify its equivalent quasivariety semantics. This class turns out to be a linguistic and axiomatic expansion of involutive bisemilattices, a subquasivariety of which forms the algebraic counterpart of Paraconsistent Weak Kleene logic. This fact sheds further light on the relationship between containment logics and logics of nonsense. (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)

Płonka sums consist of an algebraic construction similar, in some sense, to direct limits, which allows to represent classes of algebras defined by means of regular identities. Recently, Płonka sums have been connected to logic, as they provide algebraic semantics to logics obtained by imposing a syntactic filter to given logics. In this paper, I present a very general topological duality for classes of algebras admitting a Płonka sum representation in terms of dualisable algebras.

The paper studies the containment companion of a logic \. This consists of the consequence relation \ which satisfies all the inferences of \, where the variables of the conclusion are contained into those of the set of premises, in case this is not inconsistent. In accordance with the work started in [10], we show that a different generalization of the Płonka sum construction, adapted from algebras to logical matrices, allows to provide a matrix-based semantics for containment logics. In particular, (...) we provide an appropriate completeness theorem for a wide family of containment logics, and we show how to produce a complete Hilbert style axiomatization. (shrink)

In this work, we propose a variant of so-called informational semantics, a technique elaborated by Voishvillo, for two infectious logics, Deutsch’s |${\mathbf{S}_{\mathbf{fde}}}$| and Szmuc’s |$\mathbf{dS}_{\mathbf{fde}}$|⁠. We show how the machinery of informational semantics can be effectively used to analyse truth and falsity conditions of disjunction and conjunction. Using this technique, it is possible to claim that disjunction and conjunction can be rightfully regarded as such, a claim which was disputed in the recent literature. Both |${\mathbf{S}_{\mathbf{fde}}}$| and |$\mathbf{dS}_{\mathbf{fde}}$| are formalized in (...) terms of natural deduction. This allows us to solve several problems: to develop a natural deduction calculus for |${\mathbf{S}_{\mathbf{fde}}}$| containing the standard form of disjunction elimination (in contrast to the calculus by Petrukhin), to introduce the first natural deduction calculus for |$\mathbf{dS}_{\mathbf{fde}}$| and to reflect the fundamental symmetry between |${\mathbf{S}_{\mathbf{fde}}}$| and |$\mathbf{dS}_{\mathbf{fde}}$| on proof-theoretical level forming a convenient basis for obtaining their well-known extensions |$\mathbf{K}^{\mathbf{w}}_{\mathbf{3}}$| and |$\mathbf{PWK}$|⁠. (shrink)

In this paper, we study logical systems which represent entailment relations of two kinds. We extend the approach of finding ‘exactly true’ and ‘non-falsity’ versions of four-valued logics that emerged in series of recent works [Pietz & Rivieccio (2013). Nothing but the truth. Journal of Philosophical Logic, 42(1), 125–135; Shramko (2019). Dual-Belnap logic and anything but falsehood. Journal of Logics and their Applications, 6, 413–433; Shramko et al. (2017). First-degree entailment and its relatives. Studia Logica, 105(6), 1291–1317] to the case (...) of infectious logics, namely to the case of Deutsch's logic Sfde introduced in Deutsch [Relevant analytic entailment. The Relevance Logic Newsletter, 2(1), 26–44; The completeness of S. Studia Logica, 38(2), 137–147]. The particular systems obtained in this way are Setl and Snfl. We present them in the form of sequent calculi and prove corresponding soundness and completeness theorems. We illuminate the connection between Setl, Snfl and two well-known systems, strong Kleene three-valued logic K3 and Priest's Logic of Paradox LP. This connection allows us to investigate the characterisation of the entailment relations associated with Setl and Snfl as well as to introduce the notion of ‘infectious analogue’ of a certain logic. We also study implicative extensions of Setl and Snfl and prove soundness and completeness theorems for them as well. (shrink)

In his “The simple argument for subclassical logic,” Jc Beall advances an argument that led him to take FDE as the one true logic (the latter point is explicitly made clear in his “FDE as the One True Logic”). The aim of this article is to point out that if we follow Beall’s line of reasoning for endorsing FDE, there are at least two additional reasons to consider that FDE is too strong for Beall’s purposes. In fact, we claim that (...) Beall should consider another weaker subclassical logic as the logic adequate for his project. To this end, we first briefly present Beall’s argument for FDE. Then, we discuss two specific topics that seem to motivate us to weaken FDE. We then introduce a subsystem that will enjoy all the benefits of Beall’s suggestion. (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)