First Page | Document Content | |
---|---|---|
Date: 2015-01-06 05:30:45Propositional calculus Proof theory Logic in computer science Boolean algebra Formal systems Natural deduction Curry–Howard correspondence Sequent calculus Frege system Logic Mathematical logic Mathematics | Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2Add to Reading ListSource URL: www.ensiie.frDownload Document from Source WebsiteFile Size: 265,10 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 |