Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e - Curry–Howard correspondence - Document - PDFSEARCH.IO

First Page	Meta Content
	Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2 Add to Reading List Document Date: 2015-01-06 05:30:45 Open Document File Size: 265,10 KB Share Result on Facebook Company Schematic Systems We / BP / / / IndustryTerm equivalent systems / logical systems / verification tools / software certification / deductive systems / / Position representative / / ProvinceOrState Rhode Island / / Technology simulation / / SocialTag Propositional calculus Proof theory Logic in computer science Boolean algebra Formal systems Natural deduction Curry–Howard correspondence Sequent calculus Frege system Logic

Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2Add to Reading List