First Page | Document Content | |
---|---|---|
Date: 2016-04-20 00:08:12Mathematical logic Metalogic Logic Model theory Type theory Proof assistants Proof theory Higher-order logic Theoretical computer science Isabelle Simply typed lambda calculus Gdel's incompleteness theorems | Proof-producing reflection for HOL with an application to model polymorphism Benja Fallenstein1 and Ramana Kumar2 1 2Add to Reading ListSource URL: cakeml.orgDownload Document from Source WebsiteFile Size: 312,33 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 |