First Page | Document Content | |
---|---|---|
Date: 2017-09-19 19:50:55Proof theory Mathematical logic Logic Mathematics Sequent Natural deduction Cut-elimination theorem Admissible rule Proof complexity Propositional calculus Structural rule Cut rule | 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 Paleo2Add to Reading ListSource URL: pxtp.github.ioDownload Document from Source WebsiteFile Size: 327,78 KBShare Document on Facebook |
ON ANALYTICITY IN DEEP INFERENCE PAOLA BRUSCOLI AND ALESSIO GUGLIELMI In this note, we discuss the notion of analytic inference rule for propositional logics in the calculus of structures (CoSCoS generalises the sDocID: 1t0LY - View Document | |
Steve Warner Curriculum Vitae Department of Mathematics Hofstra University Hempstead, NY 11549DocID: 1rjw8 - View Document | |
Uniform interpolation and sequent calculi in modal logic Rosalie Iemhoff∗ March 28, 2015 AbstractDocID: 1ripK - View Document | |
179 Doc. Math. J. DMV Differen e S heme for the Vlasov-Manev SystemDocID: 1rgQa - View Document | |
Consequence relations and admissible rules Rosalie Iemhoff∗ Department of Philosophy Utrecht University, The Netherlands June 10, 2016DocID: 1rfeR - View Document |