Minlog: a minimal logic theorem prover. (English) Zbl 1430.68424

McCune, William (ed.), Automated deduction – CADE-14. 14th international conference on automated deduction, Townsville, North Queensland, Australia. July 13–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1249, 268-271 (1997).
Summary: 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.
For the entire collection see [Zbl 1415.68038].


68V15 Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.)
03B35 Mechanization of proofs and logical operations


Full Text: DOI


[1] R. Dyckhoff, Contraction-free Sequent Calculi for Intuitionistic Logic, Journal of Symbolic Logic 57 (1992) pp. 795-807. · Zbl 0761.03004
[2] F. Fitch, Symbolic Logic, New York, Ronald Press, 1952. · Zbl 0049.00504
[3] A. Heyting, Intuitionism, an Introduction, Amsterdam, North-Holland, 1956.
[4] I. Johansson, Der Minimalkalkl, ein reduzierter intuitionistischer Formalismus, Compositio Mathematica 4 (1936) pp. 119-136. · JFM 62.1045.08
[5] J. Slaney, Minlog, Technical report TR-ARP-12-94, Australian National University, 1994.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.