Abstract
Minlog is a theorem prover for propositional minimal logic and Heyting's intuitionist logic. It implements a decision procedure based on a cut-free sequent calculus formulation of these systems. While the method it uses is rather unsophisticated, on small problems Minlog is fast. It achieves speed by being carefully coded (in C) and by eliminating many obvious redundancies in proof searches.
It is thus useful as a point of comparison, since it represents what can be done by brute force rather than intelligence. The decision problem for the logics concerned is PSPACE hard so intelligence should easily triumph over mere speed. Minlog provides a suitable baseline for evaluating implemented systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Dyckhoff, Contraction-free Sequent Calculi for Intuitionistic Logic, Journal of Symbolic Logic 57 (1992) pp. 795–807.
F. Fitch, Symbolic Logic, New York, Ronald Press, 1952.
A. Heyting, Intuitionism, an Introduction, Amsterdam, North-Holland, 1956.
I. Johansson, Der Minimalkalkl, ein reduzierter intuitionistischer Formalismus, Compositio Mathematica 4 (1936) pp. 119–136.
J. Slaney, Minlog, Technical report TR-ARP-12-94, Australian National University, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Slaney, J. (1997). Minlog: A minimal logic theorem prover. In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-63104-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63104-0
Online ISBN: 978-3-540-69140-2
eBook Packages: Springer Book Archive