Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The foundation of a generic theorem prover

The foundation of a generic theorem prover Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or ‘logical framework’) in which the object-logics are formalized. Isabelle is now based on higher-order logic-a precise and well-understood foundation. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Automated Reasoning Springer Journals

The foundation of a generic theorem prover

Journal of Automated Reasoning , Volume 5 (3) – Aug 3, 2004

Loading next page...
 
/lp/springer-journals/the-foundation-of-a-generic-theorem-prover-h60VmjR598

References (48)

Publisher
Springer Journals
Copyright
Copyright
Subject
Computer Science; Mathematical Logic and Formal Languages; Artificial Intelligence; Mathematical Logic and Foundations; Symbolic and Algebraic Manipulation
ISSN
0168-7433
eISSN
1573-0670
DOI
10.1007/BF00248324
Publisher site
See Article on Publisher Site

Abstract

Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or ‘logical framework’) in which the object-logics are formalized. Isabelle is now based on higher-order logic-a precise and well-understood foundation.

Journal

Journal of Automated ReasoningSpringer Journals

Published: Aug 3, 2004

There are no references for this article.