Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e - Bee Cave - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-01-06 05:30:45 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 Add to Reading List Source URL: www.ensiie.fr Download Document from Source Website File Size: 265,10 KB Share Document on Facebook

	Alignment-based Translations Across Formal Systems Using Interface Theories Dennis M¨uller Colin Rothgang DocID: 1xW1M - View Document
	Analyzing individual proofs as the basis of interoperability between proof systems Gilles Dowek? Abstract. We describe the first results of a project to analyze in which theories formal proofs can be expressed and use th DocID: 1xVoc - View Document
	Formal Systems 2 P. H. Schmitt May 2016 Contents Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . DocID: 1xUNd - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ DocID: 1xUrV - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ DocID: 1xTrP - View Document