Switch to: References

Add citations

You must login to add citations.
  1. A Sound and Complete Tableaux Calculus for Reichenbach’s Quantum Mechanics Logic.Pablo Caballero & Pablo Valencia - 2024 - Journal of Philosophical Logic 53 (1):223-245.
    In 1944 Hans Reichenbach developed a three-valued propositional logic (RQML) in order to account for certain causal anomalies in quantum mechanics. In this logic, the truth-value _indeterminate_ is assigned to those statements describing physical phenomena that cannot be understood in causal terms. However, Reichenbach did not develop a deductive calculus for this logic. The aim of this paper is to develop such a calculus by means of First Degree Entailment logic (FDE) and to prove it sound and complete with respect (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Jerzy słupecki (1904–1987): Life and work.Jan Woleński & Jan Zygmunt - 1989 - Studia Logica 48 (4):401 - 411.
  • A remark on functional completeness of binary expansions of Kleene’s strong 3-valued logic.Gemma Robles & José M. Méndez - 2022 - Logic Journal of the IGPL 30 (1):21-33.
    A classical result by Słupecki states that a logic L is functionally complete for the 3-element set of truth-values THREE if, in addition to functionally including Łukasiewicz’s 3-valued logic Ł3, what he names the ‘$T$-function’ is definable in L. By leaning upon this classical result, we prove a general theorem for defining binary expansions of Kleene’s strong logic that are functionally complete for THREE.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • 40 years of FDE: An Introductory Overview.Hitoshi Omori & Heinrich Wansing - 2017 - Studia Logica 105 (6):1021-1049.
    In this introduction to the special issue “40 years of FDE”, we offer an overview of the field and put the papers included in the special issue into perspective. More specifically, we first present various semantics and proof systems for FDE, and then survey some expansions of FDE by adding various operators starting with constants. We then turn to unary and binary connectives, which are classified in a systematic manner. First-order FDE is also briefly revisited, and we conclude by listing (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  • 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 of the Truth and the False, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  • On contra-classical variants of Nelson logic n4 and its classical extension.Hitoshi Omori & Heinrich Wansing - 2018 - Review of Symbolic Logic 11 (4):805-820.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Representing voting rules in Łukasiewicz’s three-valued logic.Adrian Miroiu & Mircea Dumitru - 2022 - Journal of Applied Non-Classical Logics 32 (1):72-88.
    We show how voting rules like the simple and the absolute majority rules, unanimity, consensus, etc. can be represented as logical operators in Łukasiewicz’s three-valued logic. First, we prove tha...
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark