Switch to: References

Add citations

You must login to add citations.
  1. A Class of Implicative Expansions of Belnap-Dunn Logic in which Boolean Negation is Definable.Gemma Robles & José M. Méndez - 2023 - Journal of Philosophical Logic 52 (3):915-938.
    Belnap and Dunn’s well-known 4-valued logic FDE is an interesting and useful non-classical logic. FDE is defined by using conjunction, disjunction and negation as the sole propositional connectives. Then the question of expanding FDE with an implication connective is of course of great interest. In this sense, some implicative expansions of FDE have been proposed in the literature, among which Brady’s logic BN4 seems to be the preferred option of relevant logicians. The aim of this paper is to define a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • G3-style Sequent Calculi for Gurevich Logic and Its Neighbors.Norihiro Kamide & Sara Negri - forthcoming - Studia Logica:1-29.
    G3-style sequent calculi are introduced for a family of logics with strong negation: Gurevich logic, Nelson logic, intuitionistic propositional logic, Avron logic, De-Omori logic, and classical propositional logic. Structural properties including cut elimination are established for these calculi. In addition, a Glivenko theorem for embedding classical propositional logic into Gurevich logic is shown.
    Download  
     
    Export citation  
     
    Bookmark  
  • An Extended Paradefinite Logic Combining Conflation, Paraconsistent Negation, Classical Negation, and Classical Implication: How to Construct Nice Gentzen-type Sequent Calculi.Norihiro Kamide - 2022 - Logica Universalis 16 (3):389-417.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark