Results 271 to 280 of about 17,292 (295)
Some of the next articles are maybe not open access.
&: Automated natural deduction
1992In this paper we describe a sequent calculus-based theorem prover called −5. The underlying logic of & is that of Zermelo set theory. In addition to the usual rules of first-order sequent based systems, the logic contains inference rules to handle set abstraction terms, including the ability to unify formulae involving such terms, and the ability to ...
Dave Barker-Plummer +2 more
openaire +1 more source
Automated Natural Deduction in Thinker
Studia Logica, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Lambek Calculus in Natural Deduction
Journal of Logic and Computation, 2007A formulation of Lambek calculus in natural deduction is given. New rules for Lambek's multiplicative, non-commutative conjunction are proposed, rules for Lambek's two implications are standard. Rules for Lambek's conjunction are variants of general elimination rules: a symmetric elimination rule and its specializations, left elimination rule and right
openaire +1 more source
Another variant of natural deduction
Journal of Symbolic Logic, 1956Since 1934 various different techniques for natural deduction have been developed by Gentzen, Jaśkowski, Rosser, Quine, and others (see [1], pp. 147–167; [2], especially footnotes 1, 3, and 4; and [3], pp. 75-83, 96-107, and 289-294). It has been pointed out to me by Professor Donald Kalish of U.C.L.A.
openaire +2 more sources
1997
Abstract Axiomatic proofs are hard to construct, and often very lengthy. So in practice one does not actually construct such proofs; rather, one proves that there is a proof, as originally defined. One way in which we make use of this technique is when we allow ourselves to use, in a proof, any theorem that has been proved already.
openaire +1 more source
Abstract Axiomatic proofs are hard to construct, and often very lengthy. So in practice one does not actually construct such proofs; rather, one proves that there is a proof, as originally defined. One way in which we make use of this technique is when we allow ourselves to use, in a proof, any theorem that has been proved already.
openaire +1 more source
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics
ACM Transactions on Computational Logic, 2021Simone Martini +2 more
exaly
Natural Deduction for Dual-intuitionistic Logic
Studia Logica, 2012Luca Tranchini, Tranchini Luca
exaly
Natural deduction systems for Nelson's paraconsistent logic and its neighbors
Journal of Applied Non-Classical Logics, 2005Norihiro Kamide
exaly
Label-free natural deduction systems for intuitionistic and classical modal logics
Journal of Applied Non-Classical Logics, 2010Yakoub Salhi
exaly

