Results for 'Belnap’s four-valued logic'

990 found
Order:
  1.  29
    Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions.Alexej P. Pynko - 1999 - Journal of Applied Non-Classical Logics 9 (1):61-105.
    In this paper we study 12 four-valued logics arisen from Belnap's truth and/or knowledge four-valued lattices, with or without constants, by adding one or both or none of two new non-regular operations—classical negation and natural implication. We prove that the secondary connectives of the bilattice four-valued logic with bilattice constants are exactly the regular four-valued operations. Moreover, we prove that its expansion by any non-regular connective (such as, e.g., classical negation or (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  2.  50
    A knowledge representation based on the Belnap's four-valued logic.Yuri Kaluzhny & Alexei Yu Muravitsky - 1993 - Journal of Applied Non-Classical Logics 3 (2):189-203.
  3.  18
    An Implicative Expansion of Belnap’s Four-Valued Matrix: A Modal Four-Valued Logic Without Strong Modal Lukasiewicz-Type Paradoxes.José Miguel Blanco - 2020 - Bulletin of Symbolic Logic 26 (3-4):297-298.
  4.  18
    Four-Valued Logics BD and DM4: Expansions.Alexander S. Karpenko - 2017 - Bulletin of the Section of Logic 46 (1/2).
    The paper discusses functional properties of some four-valued logics which are the expansions of four-valued Belnap’s logic DM4. At first, we consider the logics with two designated values, and then logics defined by matrices having the same underlying algebra, but with a different choice of designated values, i.e. with one designated value. In the preceding literature both approaches were developed independently. Moreover, we present the lattices of the functional expansions of DM4.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  13
    Four-valued expansions of Dunn-Belnap's logic (I): Basic characterizations.Alexej P. Pynko - 2020 - Bulletin of the Section of Logic 49 (4):401-437.
    Basic results of the paper are that any four-valued expansion L4 of Dunn-Belnap's logic DB4 is de_ned by a unique conjunctive matrix ℳ4 with exactly two distinguished values over an expansion.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  41
    Characterizing Belnap's Logic via De Morgan's Laws.Alexej P. Pynko - 1995 - Mathematical Logic Quarterly 41 (4):442-454.
    The aim of this paper is technically to study Belnap's four-valued sentential logic . First, we obtain a Gentzen-style axiomatization of this logic that contains no structural rules while all they are still admissible in the Gentzen system what is proved with using some algebraic tools. Further, the mentioned logic is proved to be the least closure operator on the set of {Λ, V, ⌝}-formulas satisfying Tarski's conditions for classical conjunction and disjunction together with De (...)
    Direct download  
     
    Export citation  
     
    Bookmark   23 citations  
  7. A useful four-valued logic.N. D. Belnap - 1977 - In J. M. Dunn & G. Epstein (eds.), Modern Uses of Multiple-Valued Logic. D. Reidel.
     
    Export citation  
     
    Bookmark   259 citations  
  8.  17
    Neighbourhood Semantics for FDE-Based Modal Logics.S. Drobyshevich & D. Skurt - 2021 - Studia Logica 109 (6):1273-1309.
    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 \, \ (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9. Kleene's three valued logics and their children.Melvin Fitting - unknown
    Kleene’s strong three-valued logic extends naturally to a four-valued logic proposed by Belnap. We introduce a guard connective into Belnap’s logic and consider a few of its properties. Then we show that by using it four-valued analogs of Kleene’s weak three-valued logic, and the asymmetric logic of Lisp are also available. We propose an extension of these ideas to the family of distributive bilattices. Finally we show that for (...)
     
    Export citation  
     
    Bookmark   47 citations  
  10.  15
    From Belnap-Dunn Four-Valued Logic to Six-Valued Logics of Evidence and Truth.Marcelo E. Coniglio & Abilio Rodrigues - forthcoming - Studia Logica:1-46.
    The main aim of this paper is to introduce the logics of evidence and truth $$LET_{K}^+$$ and $$LET_{F}^+$$ together with sound, complete, and decidable six-valued deterministic semantics for them. These logics extend the logics $$LET_{K}$$ and $$LET_{F}^-$$ with rules of propagation of classicality, which are inferences that express how the classicality operator $${\circ }$$ is transmitted from less complex to more complex sentences, and vice-versa. The six-valued semantics here proposed extends the 4 values of Belnap-Dunn logic with (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11. A calculus for Belnap's logic in which each proof consists of two trees.Stefan Wintein & Reinhard Muskens - 2012 - Logique Et Analyse 220:643-656.
    In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a natural (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  12. Truth values, neither-true-nor-false, and supervaluations.Nuel Belnap - 2009 - Studia Logica 91 (3):305 - 334.
    The first section (§1) of this essay defends reliance on truth values against those who, on nominalistic grounds, would uniformly substitute a truth predicate. I rehearse some practical, Carnapian advantages of working with truth values in logic. In the second section (§2), after introducing the key idea of auxiliary parameters (§2.1), I look at several cases in which logics involve, as part of their semantics, an extra auxiliary parameter to which truth is relativized, a parameter that caters to special (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  32
    The logic determined by Smiley’s matrix for Anderson and Belnap’s first-degree entailment logic.José M. Méndez & Gemma Robles - 2016 - Journal of Applied Non-Classical Logics 26 (1):47-68.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14. Some Useful 16-Valued Logics: How a Computer Network Should Think.Yaroslav Shramko & Heinrich Wansing - 2005 - Journal of Philosophical Logic 34 (2):121-153.
    In Belnap's useful 4-valued logic, the set 2 = {T, F} of classical truth values is generalized to the set 4 = ������(2) = {Ø, {T}, {F}, {T, F}}. In the present paper, we argue in favor of extending this process to the set 16 = ᵍ (4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   59 citations  
  15.  72
    On łukasiewicz's four-valued modal logic.Josep Maria Font & Petr Hájek - 2002 - Studia Logica 70 (2):157-182.
    ukasiewicz''s four-valued modal logic is surveyed and analyzed, together with ukasiewicz''s motivations to develop it. A faithful interpretation of it in classical (non-modal) two-valued logic is presented, and some consequences are drawn concerning its classification and its algebraic behaviour. Some counter-intuitive aspects of this logic are discussed in the light of the presented results, ukasiewicz''s own texts, and related literature.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  16.  60
    A few more useful 8-valued logics for reasoning with tetralattice eight.Dmitry Zaitsev - 2009 - Studia Logica 92 (2):265 - 280.
    In their useful logic for a computer network Shramko and Wansing generalize initial values of Belnap’s 4-valued logic to the set 16 to be the power-set of Belnap’s 4. This generalization results in a very specific algebraic structure — the trilattice SIXTEEN 3 with three orderings: information, truth and falsity. In this paper, a slightly different way of generalization is presented. As a base for further generalization a set 3 is chosen, where initial values are (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  17.  17
    Four-Valued Logics of Truth, Nonfalsity, Exact Truth, and Material Equivalence.Adam Přenosil - 2020 - Notre Dame Journal of Formal Logic 61 (4):601-621.
    The four-valued semantics of Belnap–Dunn logic, consisting of the truth values True, False, Neither, and Both, gives rise to several nonclassical logics depending on which feature of propositions we wish to preserve: truth, nonfalsity, or exact truth. Interpreting equality of truth values in this semantics as material equivalence of propositions, we can moreover see the equational consequence relation of this four-element algebra as a logic of material equivalence. In this paper, we axiomatize all combinations of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  24
    A Few More Useful 8-valued Logics for Reasoning with Tetralattice EIGHT 4.Dmitry Zaitsev - 2009 - Studia Logica 92 (2):265-280.
    In their useful logic for a computer network Shramko and Wansing generalize initial values of Belnap’s 4-valued logic to the set 16 to be the power-set of Belnap’s 4. This generalization results in a very specific algebraic structure — the trilattice SIXTEEN3 with three orderings: information, truth and falsity. In this paper, a slightly different way of generalization is presented. As a base for further generalization a set 3 is chosen, where initial values are a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  19.  25
    Natural Deduction for Fitting’s Four-Valued Generalizations of Kleene’s Logics.Yaroslav I. Petrukhin - 2017 - Logica Universalis 11 (4):525-532.
    In this paper, we present sound and complete natural deduction systems for Fitting’s four-valued generalizations of Kleene’s three-valued regular logics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  20.  27
    On Axiomatization of Łukasiewicz's Four-Valued Modal Logic.Marcin Tkaczyk - 2011 - Logic and Logical Philosophy 20 (3):215-232.
    Formal aspects of various ways of description of Jan Łukasiewicz’s four-valued modal logic £ are discussed. The original Łukasiewicz’s description by means of the accepted and rejected theorems, together with the four-valued matrix, is presented. Then the improved E.J. Lemmon’s description based upon three specific axioms, together with the relational semantics, is presented as well. It is proved that Lemmon’s axiomatic is not independent: one axiom is derivable on the base of the remanent two. Several (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  21.  38
    A Deterministic Weakening of Belnap–Dunn Logic.Minghui Ma & Yuanlei Lin - 2019 - Studia Logica 107 (2):283-312.
    A deterministic weakening \ of the Belnap–Dunn four-valued logic \ is introduced to formalize the acceptance and rejection of a proposition at a state in a linearly ordered informational frame with persistent valuations. The logic \ is formalized as a sequent calculus. The completeness and decidability of \ with respect to relational semantics are shown in terms of normal forms. From an algebraic perspective, the class of all algebras for \ is described, and found to be (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  22.  91
    An infinity of super-Belnap logics.Umberto Rivieccio - 2012 - Journal of Applied Non-Classical Logics 22 (4):319-335.
    We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  23. Elimination of Cuts in First-order Finite-valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.
    A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.
    Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  24.  58
    Generalizing Functional Completeness in Belnap-Dunn Logic.Hitoshi Omori & Katsuhiko Sano - 2015 - Studia Logica 103 (5):883-917.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  25.  19
    Jaśkowski's criterion and three-valued paraconsistent logics.Alexander S. Karpenko - 1999 - Logic and Logical Philosophy 7:81.
    A survey is given of three-valued paraconsistent propositionallogics connected with Jaśkowski’s criterion for constructing paraconsistentlogics. Several problems are raised and four new matrix three-valued paraconsistent logics are suggested.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  26.  50
    Modal logics with Belnapian truth values.Serge P. Odintsov & Heinrich Wansing - 2010 - Journal of Applied Non-Classical Logics 20 (3):279-304.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  27.  39
    Note on a six-valued extension of three-valued logic.Josep M. Font & Massoud Moussavi - 1993 - Journal of Applied Non-Classical Logics 3 (2):173-187.
    ABSTRACT In this paper we introduce a set of six logical values, arising in the application of three-valued logics to time intervals, find its algebraic structure, and use it to define a six-valued logic. We then prove, by using algebraic properties of the class of De Morgan algebras, that this semantically defined logic can be axiomatized as Belnap's ?useful? four-valued logic. Other directions of research suggested by the construction of this set of six (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  28.  24
    An infinity of super-Belnap logics.Umberto Rivieccio - 2012 - Journal of Applied Non-Classical Logics 22 (4):319-335.
    We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new log- ics and prove a completeness result for the first and last element of the chain stating that both logics are determined (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  29.  15
    EF4, EF4-M and EF4-Ł: A companion to BN4 and two modal four-valued systems without strong Łukasiewicz-type modal paradoxes. [REVIEW]José Miguel Blanco - forthcoming - Logic and Logical Philosophy:75-104.
    The logic BN4 was defined by R.T. Brady as a four-valued extension of Routley and Meyer’s basic logic B. The system EF4 is defined as a companion to BN4 to represent the four-valued system of implication. The system Ł was defined by J. Łukasiewicz and it is a four-valued modal logic that validates what is known as strong Łukasiewicz-type modal paradoxes. The systems EF4-M and EF4-Ł are defined as alternatives to Ł (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  30.  24
    Rivals to Belnap–Dunn Logic on Interlaced Trilattices.Thomas M. Ferguson - 2017 - Studia Logica 105 (6):1123-1148.
    The work of Arnon Avron and Ofer Arieli has shown a deep relationship between the theory of bilattices and the Belnap-Dunn logic \. This correspondence has been interpreted as evidence that \ is “the” logic of bilattices, a consideration reinforced by the work of Yaroslav Shramko and Heinrich Wansing in which \ is shown to be similarly entrenched with respect to the theories of trilattices and, more generally, multilattices. In this paper, we export Melvin Fitting’s “cut-down” connectives—propositional connectives (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  16
    Modal extension of ideal paraconsistent four-valued logic and its subsystem.Norihiro Kamide & Yoni Zohar - 2020 - Annals of Pure and Applied Logic 171 (10):102830.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32. A Classicist's Note On Two-, Three-, And Four-valued Logic.Joseph Fulda - 1996 - Sorites 4:7-9.
    The classical logician's principal dictum, «A proposition is either true or false, not neither, and not both,» still leaves considerable room for multi-valued logic.
     
    Export citation  
     
    Bookmark  
  33.  83
    Nothing but the Truth.Andreas Pietz & Umberto Rivieccio - 2013 - Journal of Philosophical Logic 42 (1):125-135.
    A curious feature of Belnap’s “useful four-valued logic”, also known as first-degree entailment (FDE), is that the overdetermined value B (both true and false) is treated as a designated value. Although there are good theoretical reasons for this, it seems prima facie more plausible to have only one of the four values designated, namely T (exactly true). This paper follows this route and investigates the resulting logic, which we call Exactly True Logic.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  34.  35
    S-algebras and the degrees of maximality of three and four valued logics of Łukasiewicz.Grzegorz Malinowski - 1974 - Studia Logica 33 (4):359-370.
  35.  94
    Hyper-contradictions, generalized truth values and logics of truth and falsehood.Yaroslav Shramko & Heinrich Wansing - 2006 - Journal of Logic, Language and Information 15 (4):403-424.
    In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  36.  35
    Four-Valued Paradefinite Logics.Ofer Arieli & Arnon Avron - 2017 - Studia Logica 105 (6):1087-1122.
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  37.  52
    The Power of Belnap: Sequent Systems for SIXTEEN ₃. [REVIEW]Heinrich Wansing - 2010 - Journal of Philosophical Logic 39 (4):369 - 393.
    The trilattice SIXTEEN₃ is a natural generalization of the wellknown bilattice FOUR₂. Cut-free, sound and complete sequent calculi for truth entailment and falsity entailment in SIXTEEN₃, are presented.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  38.  98
    Four-Valued” Semantics for the Relevant Logic R.Edwin D. Mares - 2004 - Journal of Philosophical Logic 33 (3):327-341.
    This paper sets out two semantics for the relevant logic R based on Dunn's four-valued semantics for first-degree entailments. Unlike Routley's semantics for weak relevant logics, they do not use two ternary accessibility relations. Unlike Restall's semantics, they capture all of R. But there is a catch. Both of the present semantics are neighbourhood semantics, that is, they include sets of propositions in the specification of their frames.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  39.  36
    Remarks on the Gupta-Belnap fixed-point property for k-valued clones.José Martínez-Fernández - 2014 - Journal of Applied Non-Classical Logics 24 (1-2):118-131.
    Here, I first prove that certain families of k-valued clones have the Gupta-Belnap fixed-point property. This essentially means that all propositional languages that are interpreted with operators belonging to those clones are such that any net of self-referential sentences in the language can be consistently evaluated. I then focus on two four-valued generalisations of the Kleene propositional operators that generalise the strong and weak Kleene operators: Belnap’s clone and Fitting’s clone, respectively. I apply the theorems from (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  40.  19
    Aufklärung und Metaphysik. Die Neubegründung des Wissens durch Descartes. [REVIEW]S. M. - 1972 - Review of Metaphysics 26 (1):172-173.
    As the subtitle indicates, this book intends to discuss Descartes’ attempt of laying a new foundation of knowledge. In a lively and critical interpretation of Descartes’ writings, especially of his Discours de la Méthode and of his Meditationes, and a competent use of the corresponding philosophical literature the success of this attempt of enlightenment and its shortcomings, identified with the Cartesian re-introduction of the traditional metaphysics, are explained in order to allow the author in a concluding discussion to present his (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  21
    Completeness and Cut-Elimination for First-Order Ideal Paraconsistent Four-Valued Logic.Norihiro Kamide & Yoni Zohar - 2020 - Studia Logica 108 (3):549-571.
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42. Bilattices and the Semantics of Logic Programming.Melvin Fitting - unknown
    Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap’s four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex (...)
     
    Export citation  
     
    Bookmark   63 citations  
  43.  37
    The Strong Version of a Sentential Logic.Hugo Albuquerque, Josep Maria Font & Ramon Jansana - 2017 - Studia Logica 105 (4):703-760.
    This paper explores a notion of “the strong version” of a sentential logic S, initially defined in terms of the notion of a Leibniz filter, and shown to coincide with the logic determined by the matrices of S whose filter is the least S-filter in the algebra of the matrix. The paper makes a general study of this notion, which appears to unify under an abstract framework the relationships between many pairs of logics in the literature. The paradigmatic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  13
    A note on functional relations in a certain class of implicative expansions of FDE related to Brady’s 4-valued logic BN4.Gemma Robles & José M. Méndez - forthcoming - Logic Journal of the IGPL.
    The logic E4 is related to Brady’s BN4 in a similar way to which Anderson and Belnap’s logic of entailment E is related to their logic of the relevant implication R. In ‘A companion to Brady’s 4-valued relevant logic: the 4-valued logic of entailment E4’, quoted in this paper, three alternatives to BN4 and another three to E4 are summarily introduced in a couple of pages as the only alternatives containing Routley and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  93
    The logic of distributive bilattices.Félix Bou & Umberto Rivieccio - 2011 - Logic Journal of the IGPL 19 (1):183-216.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  46.  19
    Introduction: Ontology and Blackness, a Dossier.David S. Marriott - 2022 - Critical Philosophy of Race 10 (2):137-140.
    The four essays collected in this dossier are directed upon the contemporary understandings of blackness, as an ontology, a phenomenology, or a historicity. In the order of their presentation they encompass and situate what seems first to limit black being or overflow it, but which, when questioned, that is, disclosed, or unconcealed, does not fit into this logos, nor is ordered by it, even making what is most discernable about blackness in its past, future, or present, seem imaginary, moored (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  25
    The Strong Version of a Sentential Logic.Ramon Jansana, Josep Maria Font & Hugo Albuquerque - 2017 - Studia Logica 105 (4):703-760.
    This paper explores a notion of “the strong version” of a sentential logic S, initially defined in terms of the notion of a Leibniz filter, and shown to coincide with the logic determined by the matrices of S whose filter is the least S-filter in the algebra of the matrix. The paper makes a general study of this notion, which appears to unify under an abstract framework the relationships between many pairs of logics in the literature. The paradigmatic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  13
    Dynamic Encounters between Buddhism and the West Report.Laura Langone & Alexandra S. Ilieva - 2022 - Buddhist-Christian Studies 42 (1):393-394.
    In lieu of an abstract, here is a brief excerpt of the content:Dynamic Encounters between Buddhism and the West ReportLaura Langone and Alexandra S. IlievaThe following is a summary of the 2021 Postgraduate Conference titled "Dynamic Encounters between Buddhism and the West," which took place online on June 28 and 29. The conference was conceptualized, organized, and run by three AHRC funded PhD students at the University of Cambridge: Laura Langone (Faculty of Modern and Medieval Languages); Alexandra S. Ilieva (Faculty (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  13
    Every functionally complete $m$-valued logic has a Post-complete axiomatization.Nuel D. Belnap & Storrs McCall - 1970 - Notre Dame Journal of Formal Logic 11 (1):106-106.
  50.  21
    On a four-valued modal logic with deductive implication.Marcelo E. Coniglio & Martín Figallo - 2014 - Bulletin of the Section of Logic 43 (1/2):1-18.
    In this paper we propose to enrich the four-valued modal logic associated to Monteiro's Tetravalent modal algebras (TMAs) with a deductive implication, that is, such that the Deduction Meta-theorem holds in the resulting logic. All this lead us to establish some new connections between TMAs, symmetric (or involutive) Boolean algebras, and modal algebras for extensions of S5, as well as their logical counterparts.
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 990