The analysis of formalized proofs to obtain explicit bounds and convergence rates from proofs that, when expressed in natural language, appear to be nonconstructive.

Darwin is an automated theorem prover for first order clausal logic and the first implementation of the Model Evolution Calculus.

Implies that every arbitrarily long proof for any statement in propositional logic can be formalized (in polynomial time), so that one can check whether it is correct or not by only reading a constant number of letters from it!

Daemon Proof Checker, Quizmaster, Countermodel Checker, Wff Checker, Equivalency Checker.