First Page | Document Content | |
---|---|---|
Date: 2015-01-25 16:18:54Theoretical computer science Mathematical logic Logic in computer science Automated theorem proving Proof assistants Formal methods Type theory Isabelle First-order logic Logic for Computable Functions Unification HOL | LEO-II and Satallax on the Sledgehammer Test Bench Nik Sultanaa,∗, Jasmin Christian Blanchetteb , Lawrence C. Paulsona a Computer b Institut Laboratory, University of Cambridge, United KingdomAdd to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source WebsiteFile Size: 152,46 KBShare 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-basedDocID: 1xVCA - View Document | |
Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark WeberDocID: 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 WeberDocID: 1xVu1 - View Document | |
PDF DocumentDocID: 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 veryDocID: 1xVds - View Document |