This is the source code from the interactive theorem prover Isabelle as described in the paper above (1989), and the first version to use intuitionistic higher-order logic as a foundation.This work has been supported by SERC which is a predecessor of the EPSRC [grant number GR/E0355.7]
Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which ...
Propositional Logic This week’s exercises will be on propositional logic. We will do proofs both usi...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
This is the source code from the interactive theorem prover Isabelle upon its original release in 19...
Abstract. Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It r...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...
AbstractAn interactive theorem prover, Isabelle, is under development. In lcf, each inference rule i...
Isar offers a high-level proof (and theory) language for Isabelle. We give various examples of Isabe...
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered coo...
AbstractInteractive theorem provers require too much effort from their users. We have been developin...
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Isabelle [Pau94] is a generic theorem proving environment. It is written in ML, and is part of the L...
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered coo...
Interactive theorem provers require too much effort from their users. We have been developing a syst...
This book is two books. Part I is a practical introduction to working with the Isabelle proof assist...
Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which ...
Propositional Logic This week’s exercises will be on propositional logic. We will do proofs both usi...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
This is the source code from the interactive theorem prover Isabelle upon its original release in 19...
Abstract. Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It r...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...
AbstractAn interactive theorem prover, Isabelle, is under development. In lcf, each inference rule i...
Isar offers a high-level proof (and theory) language for Isabelle. We give various examples of Isabe...
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered coo...
AbstractInteractive theorem provers require too much effort from their users. We have been developin...
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Isabelle [Pau94] is a generic theorem proving environment. It is written in ML, and is part of the L...
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered coo...
Interactive theorem provers require too much effort from their users. We have been developing a syst...
This book is two books. Part I is a practical introduction to working with the Isabelle proof assist...
Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which ...
Propositional Logic This week’s exercises will be on propositional logic. We will do proofs both usi...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
DOI
Add to ORKG