Scalable Fine-Grained Proofs for Formula Processing Haniel Barbosa1,2(B) , Jasmin Christian Blanchette3,1,4 , and Pascal Fontaine1 1 Université de Lorraine, CNRS, Inria, LORIA, Nancy, France

First Page		Document Content
Date: 2017-09-19 19:50:55 Mathematical logic Logic Mathematics Predicate logic Computability theory Models of computation First-order logic Lambda calculus Term Quantifier Natural deduction CurryHoward correspondence		Scalable Fine-Grained Proofs for Formula Processing Haniel Barbosa1,2(B) , Jasmin Christian Blanchette3,1,4 , and Pascal Fontaine1 1 Université de Lorraine, CNRS, Inria, LORIA, Nancy, France Add to Reading List Source URL: pxtp.github.io Download Document from Source Website File Size: 175,64 KB Share Document on Facebook

	Counter Simulations via Higher Order Quantifier Elimination: a preliminary report Silvio Ghilardi Elena Pagani DocID: 1xTQ0 - View Document
	(Mostly Real) Quantifier Elimination Thomas Sturm AVACS Autumn School, Oldenburg, Germany, October 1, 2015 http://www.mpi-inf.mpg.de/~sturm/ DocID: 1xTFa - View Document
	QUANTIFIER ELIMINATION IN C-ALGEBRAS CHRISTOPHER J. EAGLE, ILIJAS FARAH, EBERHARD KIRCHBERG, AND ALESSANDRO VIGNATI Abstract. The only C-algebras that admit elimination of quantifiers in continuous logic are C, C2 , C( DocID: 1vfFf - View Document
	The manner and time course of updating quantifier scope representations in discourse Jakub Dotlaˇcil˚and Adrian Brasoveanu: April 21, 2014 Abstract DocID: 1veB1 - View Document
	Quantifier Elimination for quantified propositional logics on Kripke frames of type ω Matthias Baaz and Norbert Preining? Institute for Algebra and Computational Mathematics University of Technology, Vienna, Austria baa DocID: 1verz - View Document