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 semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the \ calculus, a signed tableau calculus whose rules mirror the Dunn conditions syntactically and which characterizes the Dunn logics in a uniform way. In (...) terms of the \ calculus, we first introduce two different interpolation methods, each of which uniformly shows that the Dunn logics have the interpolation property. One of the methods is closely related to Maehara’s method but the other method, which we call the pruned tableau method, is novel to this paper. We provide various reasons to prefer the pruned tableau method to the Maehara-style method. We then turn our attention to extensions of Dunn logics with so-called appropriate implication connectives. Although these logics have been considered at various places in the literature, a study of the interpolation properties of these logics is lacking. We use the pruned tableau method to uniformly show that these extended Dunn logics have the interpolation property and explain that the same result cannot be obtained via the Maehara-style method. Finally, we show how the pruned tableau method constructs interpolants for functionally complete extensions of the Dunn logics. (shrink)

The paper is devoted to the contributions of Helena Rasiowa to the theory of non-classical negation. The main results of Rasiowa in this area concerns–constructive logic with strong (Nelson) negation.

By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar (...) logics. We first study the members of our class semantically, after which we present a uniform sequent calculus that is sound and complete with respect to all of them. Two further sequent calculi and \ calculus) will be considered, which serve the same purpose and which are obtained by applying general methods to construct sequent calculi for many-valued logics. Rules and proofs in the SK calculus are much simpler and shorter than those of the \ and the \ calculus, which is one of the reasons to prefer the SK calculus over the latter two. Besides favourably comparing the SK calculus to both the \ and the \ calculus, we also hint at its philosophical significance. (shrink)

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a calculus for (...) the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof. (shrink)

One of the problems we face in many-valued logic is the difficulty of capturing the intuitive meaning of the connectives introduced through truth tables. At the same time, however, some logics have nice ways to capture the intended meaning of connectives easily, such as four-valued logic studied by Belnap and Dunn. Inspired by Dunn’s discovery, we first describe a mechanical procedure, in expansions of Belnap-Dunn logic, to obtain truth conditions in terms of the behavior of the Truth and the False, (...) which gives us intuitive readings of connectives, out of truth tables. Then, we revisit the notion of functional completeness, which is one of the key notions in many-valued logic, in view of Dunn’s idea. More concretely, we introduce a generalized notion of functional completeness which naturally arises in the spirit of Dunn’s idea, and prove some fundamental results corresponding to the classical results proved by Post and Słupecki. (shrink)

Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective of abstract (...) algebraic logic . We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of Rebagliato and Verdú . We also prove some purely algebraic results concerning bilattices, for instance that the variety of distributive bilattices is generated by the smallest non-trivial bilattice. This result is based on an improvement of a theorem by Avron stating that every bounded interlaced bilattice is isomorphic to a certain product of two bounded lattices. We generalize it to the case of unbounded interlaced bilattices. (shrink)

In a previous work we studied, from the perspective ofAlgebraic Logic, the implicationless fragment of a logic introduced by O. Arieli and A. Avron using a class of bilattice-based logical matrices called logical bilattices. Here we complete this study by considering the Arieli-Avron logic in the full language, obtained by adding two implication connectives to the standard bilattice language. We prove that this logic is algebraizable and investigate its algebraic models, which turn out to be distributive bilattices with additional implication (...) operations. We axiomatize and state several results on these new classes of algebras, in particular representation theorems analogue to the well-known one for interlaced bilattices. (shrink)

In this paper we reexamine the question of whether questions areinherently intensional entities. We do so by proposing a novelextensional theory of questions, based on a re-interpretation of thedomain of t as a bilattice rather than the usual booleaninterpretation. We discuss the adequacy of our theory with respect tothe adequacy criteria imposed on the semantics of questionsby (Groenendijk and Stokhof 1997). We show that the theory is able to account in astraightforward manner for some complex issues in the semantics ofquestions (...) including coordinated questions, combined indicative andinterrogative sentences, questions with quantifiers, and theimpossibility of negating questions. (shrink)

In this paper we re-assess the philosophical foundation of Exactly True Logic ($$\mathcal {ET\!L}$$ ET L ), a competing variant of First Degree Entailment ($$\mathcal {FDE}$$ FDE ). In order to do this, we first rebut an argument against it. As the argument appears in an interview with Nuel Belnap himself, one of the fathers of $$\mathcal {FDE}$$ FDE, we believe its provenance to be such that it needs to be taken seriously. We submit, however, that the argument ultimately fails, (...) and that $$\mathcal {ET\!L}$$ ET L cannot easily be dismissed. We then proceed to give an overview of the research that was inspired by this logic over the last decade, thus providing further motivation for the study of $$\mathcal {ET\!L}$$ ET L and, more generally, of $$\mathcal {FDE}$$ FDE -related logics that result from semantical analyses alternative to Belnap’s canonical one. We focus, in particular, on philosophical questions that these developments raise. (shrink)

We investigate some non-normal variants of well-studied paraconsistent and paracomplete modal logics that are based on N. Belnap’s and M. Dunn’s four-valued logic. Our basic non-normal modal logics are characterized by a weak extensionality rule, which reflects the four-valued nature of underlying logics. Aside from introducing our basic framework of bi-neighbourhood semantics, we develop a correspondence theory in order to prove completeness results with respect to our neighbourhood semantics for non-normal variants of \, \ and \.

Two new multilattice logics called submultilattice logic and indexed multilattice logic are introduced as a monosequent calculus and an indexed monosequent calculus, respectively. The submultilattice logic is regarded as a monosequent calculus version of Shramko’s original multilattice logic, which is also known as the logic of logical multilattices. The indexed multilattice logic is an extension of the submultilattice logic, and is regarded as the logic of multilattices. A completeness theorem with respect to a lattice-valued semantics is proved for the submultilattice (...) logic, and a completeness theorem with respect to a multilattice-valued semantics is proved for the indexed multilattice logic. (shrink)

In this study, we introduce Gentzen-type sequent calculi BDm and BDi for a modal extension and an intuitionistic modification, respectively, of De and Omori’s extended Belnap–Dunn logic BD+ with classical negation. We prove theorems for syntactically and semantically embedding BDm and BDi into Gentzen-type sequent calculi S4 and LJ for normal modal logic and intuitionistic logic, respectively. The cut-elimination, decidability, and completeness theorems for BDm and BDi are obtained using these embedding theorems. Moreover, we prove the Glivenko theorem for embedding (...) BD+ into BDi and the McKinsey–Tarski theorem for embedding BDi into BDm. (shrink)

This paper is a sequel to ‘Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values’, where a ‘bivalent’ Belnap-Dunn semantics is provided for all the expansions referred to in its title. The aim of the present paper is to carry out a parallel investigation for all natural implicative expansions of Kleene's strong 3-valued matrix now with only one designated value.

Equivalent overdetermined and underdetermined bivalent Belnap–Dunn type semantics for the logics determined by all natural implicative expansions of Kleene’s strong 3-valued matrix with only one designated value are provided.

A general Gentzen-style framework for handling both bilattice (or strong) negation and usual negation is introduced based on the characterization of negation by a modal-like operator. This framework is regarded as an extension, generalization or re- finement of not only bilattice logics and logics with strong negation, but also traditional logics including classical logic LK, classical modal logic S4 and classical linear logic CL. Cut-elimination theorems are proved for a variety of proposed sequent calculi including CLS (a conservative extension of (...) CL) and CLScw (a conservative extension of some bilattice logics, LK and S4). Completeness theorems are given for these calculi with respect to phase semantics, for SLK (a conservative extension and fragment of LK and CLScw, respectively) with respect to a classical-like semantics, and for SS4 (a conservative extension and fragment of S4 and CLScw, respectively) with respect to a Kripke-type semantics. The proposed framework allows for an embedding of the proposed calculi into LK, S4 and CL. (shrink)

We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every three-valued paraconsistent logic which is contained in classical logic, and has a proper implication connective, is ideal. Then we show that for every n > 2 there exists an extensive family of ideal n -valued logics, each one of which is not (...) equivalent to any k -valued logic with k < n. (shrink)

We present a method that generates two-sided sequent calculi for four-valued logics like "first degree entailment" (FDE). (We say that a logic is FDE-like if it has finitely many operators of finite arity, including negation, and if all of its operators are truth-functional over the four truth-values 'none', 'false', 'true', and 'both', where 'true' and 'both' are designated.) First, we show that for every n-ary operator * every truth table entry f*(x1,...,xn) = y can be characterized in terms of a (...) pair of sequent rules. Secondly, we use these sequent rules to build sequent calculi and prove their completeness. With the help of two simplification procedures we then show that the 2⋅4^n sequent rules that characterize an n-ary operator can be systematically reduced to at most four sequent rules. Thirdly, we use our method to investigate the proof-theoretical consequences of including intuitive truth-functional implications in FDE-like logics. (shrink)

Lattice logic, bilattice logic, and paraconsistent quantum logic are investigated based on monosequent systems. Paraconsistent quantum logic is an extension of lattice logic, and bilattice logic is an extension of paraconsistent quantum logic. Monosequent system is a sequent calculus based on the restricted sequent that contains exactly one formula in both the antecedent and succedent. It is known that a completeness theorem with respect to a lattice-valued semantics holds for a monosequent system for lattice logic. A completeness theorem with respect (...) to a lattice-valued semantics is proved for paraconsistent quantum logic, and a completeness theorem with respect to a bilattice-valued semantics is proved for bilattice logic. Some syntactical properties, including cut-elimination and duality, are also investigated for the monosequent systems for these logics. (shrink)

This study aims to introduce a modal extension M4CC of Arieli, Avron, and Zamansky's ideal paraconsistent four-valued logic 4CC as a Gentzen-type sequent calculus and prove the Kripke-completeness and cut-elimination theorems for M4CC. The logic M4CC is also shown to be decidable and embeddable into the normal modal logic S4. Furthermore, a subsystem of M4CC, which has some characteristic properties that do not hold for M4CC, is introduced and the Kripke-completeness and cut-elimination theorems for this subsystem are proved. This subsystem (...) is also shown to be decidable and embeddable into S4. (shrink)

We shall be concerned with the modal logic BK—which is based on the Belnap–Dunn four-valued matrix, and can be viewed as being obtained from the least normal modal logic K by adding ‘strong negation’. Though all four values ‘truth’, ‘falsity’, ‘neither’ and ‘both’ are employed in its Kripke semantics, only the first two are expressible as terms. We show that expanding the original language of BK to include constants for ‘neither’ or/and ‘both’ leads to quite unexpected results. To be more (...) precise, adding one of these constants has the effect of eliminating the respective value at the level of BK-extensions. In particular, if one adds both of these, then the corresponding lattice of extensions turns out to be isomorphic to that of ordinary normal modal logics. (shrink)

In this article we will focus our attention on the variety of distributive bisemilattices and some linguistic expansions thereof: bounded, De Morgan, and involutive bisemilattices. After extending Balbes’ representation theorem to bounded, De Morgan, and involutive bisemilattices, we make use of Hartonas–Dunn duality and introduce the categories of 2spaces and 2spaces\. The categories of 2spaces and 2spaces\ will play with respect to the categories of distributive bisemilattices and De Morgan bisemilattices, respectively, a role analogous to the category of Stone spaces (...) with respect to the category of Boolean algebras. Actually, the aim of this work is to show that these categories are, in fact, dually equivalent. (shrink)

Łukasiewicz presented two different analyses of modal notions by means of many-valued logics: the linearly ordered systems Ł3,..., Open image in new window,..., \; the 4-valued logic Ł he defined in the last years of his career. Unfortunately, all these systems contain “Łukasiewicz type paradoxes”. On the other hand, Brady’s 4-valued logic BN4 is the basic 4-valued bilattice logic. The aim of this paper is to show that BN4 can be strengthened with modal operators following Łukasiewicz’s strategy for defining truth-functional (...) modal logics. The systems we define lack “Łukasiewicz type paradoxes”. Following Brady, we endow them with Belnap–Dunn type bivalent semantics. (shrink)

Various four- and three-valued modal propositional logics are studied. The basic systems are modal extensions BK and BS4 of Belnap and Dunn's four-valued logic of firstdegree entailment. Three-valued extensions of BK and BS4 are considered as well. These logics are introduced semantically by means of relational models with two distinct evaluation relations, one for verification and the other for falsification. Axiom systems are defined and shown to be sound and complete with respect to the relational semantics and with respect to (...) twist structures over modal algebras. Sound and complete tableau calculi are presented as well. Moreover, a number of constructive non-modal logics with strong negation are faithfully embedded into BS4, into its three-valued extension B3S4, or into temporal BS4, BtS4. These logics include David Nelson's three-valued logic N3, the four-valued logic N4 bottom, the connexive logic C, and several extensions of bi-intuitionistic logic by strong negation. (shrink)

We introduce a family of preferential logics that are useful for handling information with different levels of uncertainty. The corresponding consequence relations are nonmonotonic, paraconsistent, adaptive, and rational. It is also shown that the formalisms in this family can be embedded in corresponding four-valued logics with at most three uncertainty levels, and that reasoning with these logics can be simulated by algorithms for processing circumscriptive theories, such as DLS and SCAN.

The Craig interpolation theorem is shown for an extended LJ with strong negation. A new simple proof of this theorem is obtained. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

In this paper, a way of constructing many-valued paraconsistent logics with weak double negation axioms is proposed. A hierarchy of weak double negation axioms is addressed in this way. The many-valued paraconsistent logics constructed are defined as Gentzen-type sequent calculi. The completeness and cut-elimination theorems for these logics are proved in a uniform way. The logics constructed are also shown to be decidable.

This paper is dedicated to developing a formalism that takes rejection seriously. Bilateral notation of signed formulas with force indicators is adopted to define signed consequences which can be viewed as the bilateral counterpart of Tarskian consequence relations. Its relation to some other bilateral approaches is discussed. It is shown how David Nelson’s logic N4 can be characterized bilaterally and the corresponding completeness result is proved. Further, bilateral variants of three familiar notions are considered and investigated: that of a fragment, (...) of definitional equivalence, and of a conservative extension. (shrink)

The aim of this paper is to define the logical system Sm4 characterised by the degree of truth-preserving consequence relation defined on the ordered set of values of Smiley’s four-element matrix MSm4. The matrix MSm4 has been of considerable importance in the development of relevant logics and it is at the origin of bilattice logics. It will be shown that Sm4 is a most interesting paraconsistent logic which encloses a sound theory of logical necessity similar to that of Anderson and (...) Belnap’s logic of entailment E. Intuitively, Sm4 can be described as a four-valued expansion of the positive fragment of Lewis’ S5 or, alternatively, as a four-valued version of S5. (shrink)

We investigate two large families of logics, differing from each other by the treatment of negation. The logics in one of them are obtained from the positive fragment of classical logic (with or without a propositional constant ff for “the false”) by adding various standard Gentzen-type rules for negation. The logics in the other family are similarly obtained from LJ+, the positive fragment of intuitionistic logic (again, with or without ff). For all the systems, we provide simple semantics which is (...) based on non-deterministic four-valued or three-valued structures, and prove soundness and completeness for all of them. We show that the role of each rule is to reduce the degree of non-determinism in the corresponding systems. We also show that all the systems considered are decidable, and our semantics can be used for the corresponding decision procedures. Most of the extensions of LJ+ (with or without ff) are shown to be conservative over the underlying logic, and it is determined which of them are not. (shrink)

In this study, falsification-aware semantics and sequent calculi for first-order classical logic are introduced and investigated. These semantics and sequent calculi are constructed based on a falsification-aware setting for first-order Nelson constructive three-valued logic. In fact, these semantics and sequent calculi are regarded as those for a classical variant of N3. The completeness and cut-elimination theorems for the proposed semantics and sequent calculi are proved using Schütte’s method. Similar results for the propositional case are also obtained.

First-order intuitionistic and classical Nelson–Wansing and Arieli–Avron–Zamansky logics, which are regarded as paradefinite and connexive logics, are investigated based on Gentzen-style sequent calculi. The cut-elimination and completeness theorems for these logics are proved uniformly via theorems for embedding these logics into first-order intuitionistic and classical logics. The modified Craig interpolation theorems for these logics are also proved via the same embedding theorems. Furthermore, a theorem for embedding first-order classical Arieli–Avron–Zamansky logic into first-order intuitionistic Arieli–Avron–Zamansky logic is proved using a modified (...) Gödel–Gentzen negative translation. The failure of a theorem for embedding first-order classical Nelson–Wansing logic into first-order intuitionistic Nelson–Wansing logic is also shown. (shrink)

Strict/tolerant logic, ST, evaluates the premises and the consequences of its consequence relation differently, with the premises held to stricter standards while consequences are treated more tolerantly. More specifically, ST is a three-valued logic with left sides of sequents understood as if in Kleene’s Strong Three Valued Logic, and right sides as if in Priest’s Logic of Paradox. Surprisingly, this hybrid validates the same sequents that classical logic does. A version of this result has been extended to meta, metameta, … (...) consequence levels in Barrio et al.. In my earlier paper Fitting I showed that the original ideas behind ST are, in fact, much more general than first appeared, and an infinite family of many valued logics have Strict/Tolerant counterparts. This family includes both Kleene’s and Priest’s logic individually, as well as first degree entailment. For instance, for both the Kleene and the Priest logic, the corresponding strict/tolerant logic is six-valued, but with differing sets of strictly and tolerantly designated truth values. The present paper extends that generalization in two directions. We examine a reverse notion, of Tolerant/Strict logics, which exist for the same structures that were investigated in Fitting. And we show that the generalization extends through the meta, metameta, … consequence levels for the same infinite family of many valued logics. Finally we close with remarks on the status of cut and related rules, which can actually be rather nuanced. Throughout, the aim is not the philosophical applications of the Strict/Tolerant idea, but the determination of how general a phenomenon it is. (shrink)

ABSTRACTA conditional is natural if it fulfils the three following conditions. It coincides with the classical conditional when restricted to the classical values T and F; it satisfies the Modus Ponens; and it is assigned a designated value whenever the value assigned to its antecedent is less than or equal to the value assigned to its consequent. The aim of this paper is to provide a ‘bivalent’ Belnap-Dunn semantics for all natural implicative expansions of Kleene's strong 3-valued matrix with two (...) designated elements. (shrink)

I extend theories of nonmonotonic reasoning to account for reasons allowing free choice. My approach works with a wide variety of approaches to nonmonotonic reasoning and explains the connection between reasons for kinds of action and reasons for actions or subkinds falling under them. I use an Anderson–Kanger reduction of reason statements, identifying key principles in the logic of reasons.

In this study, an extended paradefinite logic with classical negation (EPLC), which has the connectives of conflation, paraconsistent negation, classical negation, and classical implication, is introduced as a Gentzen-type sequent calculus. The logic EPLC is regarded as a modification of Arieli, Avron, and Zamansky’s ideal four-valued paradefinite logic (4CC) and as an extension of De and Omori’s extended Belnap–Dunn logic with classical negation (BD+) and Avron’s self-extensional four-valued paradefinite logic (SE4). The completeness, cut-elimination, and decidability theorems for EPLC are proved (...) and EPLC is shown to be embeddable into classical logic. The strong equivalence substitution property and the admissibilities of the rules of negative symmetry, contraposition, and involution are shown for EPLC. Some alternative simple Gentzen-type sequent calculi, which are theorem-equivalent to EPLC, are obtained via these characteristic properties. (shrink)

Two intuitionistic paradefinite logics N4C and N4C+ are introduced as Gentzen-type sequent calculi. These logics are regarded as a combination of Nelson’s paraconsistent four-valued logic N4 and Wansing’s basic constructive connexive logic C. The proposed logics are also regarded as intuitionistic variants of Arieli, Avron, and Zamansky’s ideal paraconistent four-valued logic 4CC. The logic N4C has no quasi-explosion axiom that represents a relationship between conflation and paraconsistent negation, but the logic N4C+ has this axiom. The Kripke-completeness and cut-elimination theorems for (...) N4C and N4C+ are proved. (shrink)

Paradefinite logics are logics that can be used for handling contradictory or partial information. As such, paradefinite logics should be both paraconsistent and paracomplete. In this paper we consider the simplest semantic framework for introducing paradefinite logics. It consists of the four-valued matrices that expand the minimal matrix which is characteristic for first degree entailments: Dunn–Belnap matrix. We survey and study the expressive power and proof theory of the most important logics that can be developed in this framework.

Baltag, Moss, and Solecki proposed an expansion of classical modal logic, called logic of epistemic actions and knowledge (EAK), in which one can reason about knowledge and change of knowledge. Kurz and Palmigiano showed how duality theory provides a flexible framework for modeling such epistemic changes, allowing one to develop dynamic epistemic logics on a weaker propositional basis than classical logic (for example an intuitionistic basis). In this paper we show how the techniques of Kurz and Palmigiano can be further (...) extended to define and axiomatize a bilattice logic of epistemic actions and knowledge (BEAK). Our propositional basis is a modal expansion of the well-known four-valued logic of Belnap and Dunn, which is a system designed for handling inconsistent as well as potentially conflicting information. These features, we believe, make our framework particularly promising from a computer science perspective. (shrink)

In this document, we describe the concepts of ideal semantics and stage semantics for abstract argumentation in terms of argument labellings. The difference between the traditional extensions approach and the labelling approach is that where the former only identifies the sets of accepted arguments, the latter also identifies the rejected arguments as well as the arguments that are neither accepted nor rejected. So far, the labellings approach has been successfully applied to complete, grounded, preferred, stable and semi-stable semantics, as well (...) as to the concept of admissibility. In the current paper, we continue this line of research by showing that ideal semantics and stage semantics can also be described in terms of argument labellings. (shrink)

The logics BN4 and E4 can be considered as the 4-valued logics of the relevant conditional and (relevant) entailment, respectively. The logic BN4 was developed by Brady in 1982 and the logic E4 by Robles and Méndez in 2016. The aim of this paper is to investigate the implicative variants (of both systems) which contain Routley and Meyer’s logic B and endow them with a Belnap-Dunn type bivalent semantics.

In this study, we prove the completeness and cut-elimination theorems for a first-order extension F4CC of Arieli, Avron, and Zamansky’s ideal paraconsistent four-valued logic known as 4CC. These theorems are proved using Schütte’s method, which can simultaneously prove completeness and cut-elimination.

A rejection system, also referred to as a complementary calculus, is a proof system axiomatising the invalid formulas of a logic, in contrast to traditional calculi which axiomatise the valid ones. Rejection systems therefore introduce a purely syntactic way of determining non-validity without having to consider countermodels, which can be useful in procedures for automated deduction and proof search. Rejection calculi have first been formally introduced by Łukasiewicz in the context of Aristotelian syllogistic and subsequently rejection systems for many well-known (...) logics have been proposed. In this paper, we deal with rejection systems for so-called non-deterministic finite-valued logics, a special case of non-deterministic many-valued logics which were introduced by Avron and Lev as a generalisation of traditional many-valued logics. More specifically, we introduce a systematic method for constructing sequent-style rejection systems for any given non-deterministic finite-valued logic. Furthermore, as special instances of our method, we provide concrete calculi for specific paraconsistent logics which can be characterised in terms of non-deterministic two- and three-valued semantics, respectively. (shrink)

RESUMO O presente artigo apresenta uma semântica baseada nas atitudes cognitivas de aceitação e rejeição por uma sociedade de agentes para lógicas inspiradas no First Degree Entailment de Dunn e Belnap. Diferente das situações epistêmicas originalmente usadas em E, as atitudes cognitivas não coincidem com valores-de-verdade e parecem mais adequadas para as lógicas que pretendem considerar o conteúdo informacional de proposições “ditas verdadeiras” tanto quanto as proposições “ditas falsas” como determinantes da noção de validade das inferências. Após analisar algumas lógicas (...) associadas à semântica proposta, introduzimos a lógica E B cuja relação de consequência semântica subjacente - o B-entailment - é capaz de expressar diversos tipos de raciocínio em relação às atitudes cognitivas de aceitação e rejeição. Apresentamos também um cálculo de sequentes correto e completo para E B.ABSTRACT In the present work I introduce a semantics based on the cognitive attitudes of acceptation and rejection entertained by a given society of agents for logics inspired on Dunn and Belnap’s ‘First Degree Entailment’. Distinctly from the original epistemic situation of E, the cognitive attitudes do not coincide with truth-values and it seems more suitable for logics that intend to consider the informational content of propositions “said to be true” as well as propositions “said to be false” as determinants of the notion of logical validity. After analyzing some logics associated with the proposed semantics, we introduce the logic E B, whose underlying semantic entailment relation - the B-entailment - is able to express several kinds of reasoning towards the cognitive attitudes of acceptance and rejection. Acorrect and complete sequent calculus for E B is also presented. (shrink)

We analyze the variety of A. Monteiro’s tetravalent modal algebras under the perspective of two logic systems naturally associated to it. Taking profit of the contrapositive implication introduced by A. Figallo and P. Landini, sound and complete Hilbert-style calculi for these logics are presented.