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

Propositional Proof Complexity Instructor: Alexander Razborov, University of Chicago. Course Homepage: http://people.cs.uchicago.edu/~razborov/teaching/winter09.html Winter, 2009 and Winter, 2014

DocID: 1uiqc - View Document

Oracle Complexity of Second-Order Methods for Finite-Sum Problems A. Proofs A.1. Auxiliary Lemmas The following lemma was essentially proven in (Lan, 2015; Nesterov, 2013), but we provide a proof for completeness: Lemma

DocID: 1tF1c - View Document

Cambridge University Press4 - Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen Excerpt More information

DocID: 1tqEc - View Document

Cambridge University Press4 - Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen Copyright Information More information

DocID: 1tpid - View Document

Cambridge University Press4 - Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen Frontmatter More information

DocID: 1toM0 - View Document