First Page | Document Content | |
---|---|---|
Date: 2015-01-06 05:30:45Propositional 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 & LORIA2Add to Reading ListSource URL: www.ensiie.frDownload Document from Source WebsiteFile Size: 265,10 KBShare Document on Facebook |