Minlog: A minimal logic theorem prover

  • John Slaney
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1249)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Dyckhoff, Contraction-free Sequent Calculi for Intuitionistic Logic, Journal of Symbolic Logic 57 (1992) pp. 795–807.Google Scholar
  2. 2.
    F. Fitch, Symbolic Logic, New York, Ronald Press, 1952.Google Scholar
  3. 3.
    A. Heyting, Intuitionism, an Introduction, Amsterdam, North-Holland, 1956.Google Scholar
  4. 4.
    I. Johansson, Der Minimalkalkl, ein reduzierter intuitionistischer Formalismus, Compositio Mathematica 4 (1936) pp. 119–136.Google Scholar
  5. 5.
    J. Slaney, Minlog, Technical report TR-ARP-12-94, Australian National University, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • John Slaney
    • 1
  1. 1.Australian National UniversityCanberraAustralia

Personalised recommendations