A First Step Towards a Unified Proof Checker for QBF Toni Jussila1 , Armin Biere1 , Carsten Sinz2 , Daniel Kr¨ oning3 , and Christoph M. Wintersteiger3 1

First Page		Document Content
Date: 2008-01-30 18:21:35 Automated theorem proving Complexity classes Boolean algebra Model theory True quantified Boolean formula Predicate logic Resolution Skolem normal form FO Theoretical computer science Mathematics Mathematical logic		A First Step Towards a Unified Proof Checker for QBF Toni Jussila1 , Armin Biere1 , Carsten Sinz2 , Daniel Kr¨ oning3 , and Christoph M. Wintersteiger3 1 Add to Reading List Source URL: www.winterstiger.at Download Document from Source Website File Size: 217,73 KB Share Document on Facebook

	On Skolemization in constructive theories Matthias Baaz∗ Rosalie Iemhoff Inst. for Discrete Math. and Geometry E104 DocID: 1rdlF - View Document
	Context-givenness vs. existential quantification Salvador Mascarenhas New York University This paper argues that there are strong parallelisms between indefinite noun phrases and two seemingly unrelated constructions, na DocID: 1qSBy - View Document
	Eskolemization in intuitionistic logic Matthias Baaz∗ Inst. for Discr. Math. and Geom. Technical University Vienna Wiedner HauptstrasseVienna, Austria DocID: 1qBJr - View Document
	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning” DocID: 1pBEb - View Document
	Skolemization, Most General Unifiers, First-Order Resolution Torsten Hahmann CSC 384, University of Toronto March 07, 2011 DocID: 1ot1b - View Document