Switch to: References

Add citations

You must login to add citations.
  1. Algebraic Completeness of Connexive and Bi-Intuitionistic Multilattice Logics.Yaroslav Petrukhin - forthcoming - Journal of Logic, Language and Information.
    In this paper, we introduce the notions of connexive and bi-intuitionistic multilattices and develop on their base the algebraic semantics for Kamide, Shramko, and Wansing’s connexive and bi-intuitionistic multilattice logics which were previously known in the form of sequent calculi and Kripke semantics. We prove that these logics are sound and complete with respect to the presented algebraic structures.
    Download  
     
    Export citation  
     
    Bookmark  
  • Modal and Intuitionistic Variants of Extended Belnap–Dunn Logic with Classical Negation.Norihiro Kamide - 2021 - Journal of Logic, Language and Information 30 (3):491-531.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Falsification-Aware Calculi and Semantics for Normal Modal Logics Including S4 and S5.Norihiro Kamide - 2023 - Journal of Logic, Language and Information 32 (3):395-440.
    Falsification-aware (hyper)sequent calculi and Kripke semantics for normal modal logics including S4 and S5 are introduced and investigated in this study. These calculi and semantics are constructed based on the idea of a falsification-aware framework for Nelson’s constructive three-valued logic. The cut-elimination and completeness theorems for the proposed calculi and semantics are proved.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Two proofs of the algebraic completeness theorem for multilattice logic.Oleg Grigoriev & Yaroslav Petrukhin - 2019 - Journal of Applied Non-Classical Logics 29 (4):358-381.
    Shramko [. Truth, falsehood, information and beyond: The American plan generalized. In K. Bimbo, J. Michael Dunn on information based logics, outstanding contributions to logic...
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Modal multilattice logics with Tarski, Kuratowski, and Halmos operators.Oleg Grigoriev & Yaroslav Petrukhin - forthcoming - Logic and Logical Philosophy:1.
    Download  
     
    Export citation  
     
    Bookmark   1 citation