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

Logic / Mathematical logic / Propositional calculus / Proof theory / Automated theorem proving / Logical truth / Boolean algebra / Frege system / Substitution / Natural deduction / Hilbert system / Sequent

A On the Power of Substitution in the Calculus of Structures Novak Novakovi´c, Inria Lutz Straßburger, Inria There are two contributions in this paper. First, we give a direct proof of the known fact that Frege system

DocID: 1qGVY - View Document

Mixed Modal Propositional Logic Wffs For practice, you might go through each wff and give a falsifying model for every system in which the wff is not valid, and a semantic validity proof for every system in which the wff

DocID: 1m0PP - View Document

Propositional 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 & LORIA2

DocID: 1ggFx - View Document

A Subatomic Proof System Andrea Aler Tubella and Alessio Guglielmi University of Bath In this work we show a proof system, called SA, that generates propositional proofs by employing a single, linear, simple and regular

DocID: 1bTaB - View Document

A Subatomic Proof System Andrea Aler Tubella and Alessio Guglielmi University of Bath In this work we show a proof system, called SA, that generates propositional proofs by employing a single, linear, simple and regular

DocID: 1bF6Y - View Document