Minlog
swMATH ID:  30424 
Software Authors:  Slaney, John 
Description:  Minlog: A minimal logic theorem prover. Minlog is a theorem prover for propositional minimal logic and Heyting’s intuitionist logic. It implements a decision procedure based on a cutfree 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. 
Homepage:  https://link.springer.com/chapter/10.1007%2F3540631046_27 
Related Software:  TPTP 
Cited in:  2 Documents 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

Minlog: a minimal logic theorem prover. Zbl 1430.68424 Slaney, John 
1997

Cited by 2 Authors
1  Demri, StĂ©phane P. 
1  Slaney, John K. 
Cited in 1 Serial
1  Journal of Applied NonClassical Logics 
Cited in 2 Fields
2  Mathematical logic and foundations (03XX) 
1  Computer science (68XX) 