ProofWeb is both a system for teaching logic and for using proof assistants through the web.
ProofWeb can be used in three ways. First, one can use the guest login, for which one does not even need to register. Secondly, a user can be a student in a logic or proof assistants course. We are hosting courses free of charge. If you are a teacher and would like to host your course on this server, send email to proofweb@cs.ru.nl. Thirdly, if teachers do not want to trust us with their students' files, they can freely download the ProofWeb system and run it on a server of their own.
HOL4 is the latest version of the HOL interactive proof assistant for higher order logic: a programming environment in which theorems can be proved and proof tools implemented. Built-in decision procedures and theorem provers can automatically establish many simple theorems (users may have to prove the hard theorems themselves!) An oracle mechanism gives access to external programs such as SAT and BDD engines. HOL 4 is particularly suitable as a platform for implementing combinations of deduction, execution and property checking. several widely used versions of the HOL system: 1. HOL88 from Cambridge; 2. HOL90 from Calgary and Bell Labs; 3. HOL98 from Cambridge, Glasgow and Utah. HOL 4 is the successor to these. Its development was partly supported by the PROSPER project. HOL 4 is based on HOL98 and incorporates ideas and tools from HOL Light. The ProofPower system is another implementation of HOL.
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjecture and prove theorems automatically. The system provides an interactive tracing tool that allows you to interact the proof planning attempt. (see the screenshot of IsaPlanner being used with Isabelle and Proof General) It is based on the Isabelle theorem prover and the Isar language. The main proof technique written in IsaPlanner is an inductive theorem prover based on Rippling. This is applicable within Isabelle's Higher Order Logic, and can easily be adapted to Isabelle's other logics. The system now the main platform for proof planning research in the Edinburgh mathematical reasoning group
H. Cao, und X. Zhu. (2006)cite arxiv:math/0612069Comment: This is a revised version of the article by the same authors that originally appeared in Asian J. Math., 10(2) (2006), 165--492.
M. Codescu, und T. Mossakowski. Algebra and Coalgebra in Computer Science, CALCO'11, Volume 6859 von Lecture Notes in Computer Science, Seite 145-160. Springer, (2011)
G. Delzanno. Electronic Notes in Theoretical Computer Science, 50 (4):
371--385(2001)VEPAS 2001, Verification of Parameterized Systems (Satellite Workshop of ICALP 2001).
R. Gheyi, T. Massoni, und P. Borba. ASE '05: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering, Seite 372--375. New York, NY, USA, ACM, (2005)