<--- Back to Details
First PageDocument Content
Proof theory / Automated theorem proving / Logic in computer science / Propositional calculus / Computational complexity theory / Natural deduction / Sequent calculus / Propositional proof system / Proof complexity / Logic / Mathematical logic / Mathematics
Date: 2006-08-24 20:08:31
Proof theory
Automated theorem proving
Logic in computer science
Propositional calculus
Computational complexity theory
Natural deduction
Sequent calculus
Propositional proof system
Proof complexity
Logic
Mathematical logic
Mathematics

Add to Reading List

Source URL: boole.stanford.edu

Download Document from Source Website

File Size: 390,02 KB

Share Document on Facebook

Similar Documents

Proof 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 Paleo2

DocID: 1xVA3 - View Document

INL (instantial neighborhood logic) - tableau, sequent calculus, interpolation Junhua Yu () Tsinghua University (Beijing, China @ Steklov Mathematical Institute

DocID: 1v7WD - View Document

A Sequent Calculus for Nominal Logic Murdoch Gabbay ´ LIX Ecole Polytechnique

DocID: 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))   x

DocID: 1tMEW - View Document

Lecture Notes on Sequent Calculus: Modal Logic Frank Pfenning Lecture 8 February 9, 2010

DocID: 1t2mj - View Document