Checkable Proofs for First-Order Theorem Proving Giles Reger1 , Martin Suda2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria

First Page		Document Content
Date: 2017-08-08 03:28:45 Software Automated theorem proving Theoretical computer science Formal methods TPTP Proof assistant Frama-C Theorem prover E theorem prover Theorem Isabelle		Checkable Proofs for First-Order Theorem Proving Giles Reger1 , Martin Suda2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 194,64 KB Share Document on Facebook

	LATEX Sugar for Isabelle Documents Florian Haftmann, Gerwin Klein, Tobias Nipkow, Norbert Schirmer August 15, 2018 Abstract This document shows how to typset mathematics in Isabelle-based DocID: 1xVCA - View Document
	Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber DocID: 1xVzf - View Document
	Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber DocID: 1xVu1 - View Document
	PDF Document DocID: 1xVhU - View Document
	Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very DocID: 1xVds - View Document