Logics Workbench.

Tool for minimizing boolean logic functions.

A PROver with a Theory Extension INterface. Theorem prover for first-order clause logic, written in ECRC's Prolog-dialect ECLiPSe. Free download, documentation.

A list (>50 entries) of automatic resolution provers (like Otter), interactive provers (like PVS) and other mechanized reasoning tools.

Web resource provided by research group. Includes access to software developed by the team, coverering such projects as FINDER (Finite Domain Enumerator), MaGIC (Matrix Generator for Implication Connectives) and Kripke (A theorem prover for the relevant logic LR).

A generic sequent prover for propositional finitely-valued logics.

Takes as input the specification of a finitely-valued first-order logic and produces a sequent calculus, a natural deduction system, and clause formation rules for this logic.

A generic theorem proving environment developed at Cambridge University (Larry Paulson) and TU Munich (Tobias Nipkow). Includes logic, documentation and free download.

Deals with effectively machine-checked formal mathematics. In practice, this includes the study of mathematical formalisms well-suited for implementations, the implementations themselves and the use of these for various applications. Focuses on software correctness proofs.

By Jon Barwise and John Etchemendy.