Switch to: References

Add citations

You must login to add citations.
  1. Normality, Non-contamination and Logical Depth in Classical Natural Deduction.Marcello D’Agostino, Dov Gabbay & Sanjay Modgil - 2020 - Studia Logica 108 (2):291-357.
    In this paper we provide a detailed proof-theoretical analysis of a natural deduction system for classical propositional logic that represents classical proofs in a more natural way than standard Gentzen-style natural deduction, admits of a simple normalization procedure such that normal proofs enjoy the Weak Subformula Property, provides the means to prove a Non-contamination Property of normal proofs that is not satisfied by normal proofs in the Gentzen tradition and is useful for applications, especially in formal argumentation, naturally leads to (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  • Translations Between Gentzen–Prawitz and Jaśkowski–Fitch Natural Deduction Proofs.Shawn Standefer - 2019 - Studia Logica 107 (6):1103-1134.
    Two common forms of natural deduction proof systems are found in the Gentzen–Prawitz and Jaśkowski–Fitch systems. In this paper, I provide translations between proofs in these systems, pointing out the ways in which the translations highlight the structural rules implicit in the systems. These translations work for classical, intuitionistic, and minimal logic. I then provide translations for classical S4 proofs.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • Translations Between Gentzen–Prawitz and Jaśkowski–Fitch Natural Deduction Proofs.Shawn Standefer - 2019 - Studia Logica 107 (6):1103-1134.
    Two common forms of natural deduction proof systems are found in the Gentzen–Prawitz and Jaśkowski–Fitch systems. In this paper, I provide translations between proofs in these systems, pointing out the ways in which the translations highlight the structural rules implicit in the systems. These translations work for classical, intuitionistic, and minimal logic. I then provide translations for classical S4 proofs.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • James W. Garson, Modal Logic for Philosophers. Second Edition, Cambridge University Press, Cambridge, 2013, Pp. 506. ISBN: 978-1107609525 (Paperback) $44.99. [REVIEW]Lloyd Humberstone - 2016 - Studia Logica 104 (2):365-379.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Automated Proof-Searching for Strong Kleene Logic and its Binary Extensions Via Correspondence Analysis.Yaroslav Petrukhin & Vasilyi Shangin - forthcoming - Logic and Logical Philosophy:1.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Calculus of Higher-Level Rules, Propositional Quantification, and the Foundational Approach to Proof-Theoretic Harmony.Peter Schroeder-Heister - 2014 - Studia Logica 102 (6):1185-1216.
    We present our calculus of higher-level rules, extended with propositional quantification within rules. This makes it possible to present general schemas for introduction and elimination rules for arbitrary propositional operators and to define what it means that introductions and eliminations are in harmony with each other. This definition does not presuppose any logical system, but is formulated in terms of rules themselves. We therefore speak of a foundational account of proof-theoretic harmony. With every set of introduction rules a canonical elimination (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Natural Deduction for the Sheffer Stroke and Peirce’s Arrow (and Any Other Truth-Functional Connective).Richard Zach - 2016 - Journal of Philosophical Logic 45 (2):183-197.
    Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for intuitionistic versions of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Natural Deduction for Post’s Logics and Their Duals.Yaroslav Petrukhin - 2018 - Logica Universalis 12 (1-2):83-100.
    In this paper, we introduce the notion of dual Post’s negation and an infinite class of Dual Post’s finitely-valued logics which differ from Post’s ones with respect to the definitions of negation and the sets of designated truth values. We present adequate natural deduction systems for all Post’s k-valued ) logics as well as for all Dual Post’s k-valued logics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations