First Page | Document Content | |
---|---|---|
Date: 2014-04-14 05:43:30Mathematical logic Proof theory Logic Mathematics Natural deduction Sequent calculus Sequent First-order logic Admissible rule Conjunctive normal form Quantifier Cut-elimination theorem | Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of TechnologyAdd to Reading ListSource URL: www.logic.atDownload Document from Source WebsiteFile Size: 326,87 KBShare Document on Facebook |
Under consideration for publication in Math. Struct. in Comp. Science Complexity of Translations from Resolution to Sequent Calculus (Presentation-Only - Draft) Giselle Reis1 and Bruno Woltzenlogel Paleo2DocID: 1xVA3 - View Document | |
INL (instantial neighborhood logic) - tableau, sequent calculus, interpolation Junhua Yu () Tsinghua University (Beijing, China @ Steklov Mathematical InstituteDocID: 1v7WD - View Document | |
A Sequent Calculus for Nominal Logic Murdoch Gabbay ´ LIX Ecole PolytechniqueDocID: 1tYXN - View Document | |
1 Prove (or provide a failed proof of) the following statement using the sequent calculus: x y (P (x) → Q(x, y)) xDocID: 1tMEW - View Document | |
Lecture Notes on Sequent Calculus: Modal Logic Frank Pfenning Lecture 8 February 9, 2010DocID: 1t2mj - View Document |