Switch to: References

Add citations

You must login to add citations.
  1. Calculi for Many-Valued Logics.Michael Kaminski & Nissim Francez - 2021 - Logica Universalis 15 (2):193-226.
    We present a number of equivalent calculi for many-valued logics and prove soundness and strong completeness theorems. The calculi are obtained from the truth tables of the logic under consideration in a straightforward manner and there is a natural duality among these calculi. We also prove the cut elimination theorems for the sequent-like systems.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Proof-Theoretic Semantics for Adjectival Modification.Nissim Francez - 2017 - Journal of Logic, Language and Information 26 (1):21-43.
    The paper introduces a proof-theoretic semantics for adjectival modification as an alternative to the traditional model-theoretic semantics basing meaning on truth-conditions. The paper considers the proof-theoretic meaning of modification by means of the three traditional adjective classes: intersective, subsective and privative. It does so by introducing a meaning-conferring natural-deduction proof system for such modification. The PTS theory of meaning is not polluted by ontological commitments, for example, a scale for beauty and a yardstick for being beautiful. It only uses syntactic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On a Generality Condition in Proof‐Theoretic Semantics.Bogdan Dicher - 2017 - Theoria 83 (4):394-418.
    In the recent literature on proof-theoretic semantics, there is mention of a generality condition on defining rules. According to this condition, the schematic formulation of the defining rules must be maximally general, in the sense that no restrictions should be placed on the contexts of these rules. In particular, context variables must always be present in the schematic rules and they should range over arbitrary collections of formulae. I argue against imposing such a condition, by showing that it has undesirable (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • An Alternative Normalization of the Implicative Fragment of Classical Logic.Branislav Boričić & Mirjana Ilić - 2015 - Studia Logica 103 (2):413-446.
    A normalizable natural deduction formulation, with subformula property, of the implicative fragment of classical logic is presented. A traditional notion of normal deduction is adapted and the corresponding weak normalization theorem is proved. An embedding of the classical logic into the intuitionistic logic, restricted on propositional implicational language, is described as well. We believe that this multiple-conclusion approach places the classical logic in the same plane with the intuitionistic logic, from the proof-theoretical viewpoint.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Sentence connectives in formal logic.Lloyd Humberstone - forthcoming - Stanford Encyclopedia of Philosophy.