An Intuitionistic Predicate Logic Theorem Prover

Authors:
Dan Sahlin;Torkel Franzen;Seif Haridi
Affiliations:
-;-;-
Venue:
An Intuitionistic Predicate Logic Theorem Prover
Year:
1989

Citing 0
Cited 1

Unification Algorithms for Eliminating and Introducing Quantifiers in Natural Deduction Automated Theorem Proving

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

A complete theorem prover for intuitionistic predicate logic based on the cut-free calculus is presented. It includes a treatment of "quasi-free" identity based on a delay mechanism and a special form of unification. Several important optimizations of the basic algorithm are introduced. The resulting system is available in source form from SICS; an Appendix gives some idea of its performance.