The Theory behind TheoryMine Alan Bundy School of Informatics, University of Edinburgh, Edinburgh EH8 9AB, Edinburgh, Scotland. Lucas Dixon

First Page		Document Content
Date: 2010-07-11 12:18:50 Computability theory Mathematics Mathematical logic Theoretical computer science Recursion Theory of computation Primitive recursive function Recursive data type Mutual recursion Automated theorem proving Theorem Presentation of a group		The Theory behind TheoryMine Alan Bundy School of Informatics, University of Edinburgh, Edinburgh EH8 9AB, Edinburgh, Scotland. Lucas Dixon Add to Reading List Source URL: dream.inf.ed.ac.uk Download Document from Source Website File Size: 242,36 KB Share Document on Facebook

	AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION DocID: 1vah4 - View Document
	Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for DocID: 1sXwT - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson DocID: 1sOSK - View Document
	Microsoft Word - BlankPage DocID: 1rugC - View Document
	SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany DocID: 1rrok - View Document