<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2011-11-17 12:13:56Proof assistants Automated theorem proving Logic in computer science Type theory Automath Logic for Computable Functions Nqthm Proof theory ACL2 Mathematical proof Andrzej Trybulec Isabelle |
Add to Reading List |
Can the computer really help us to prove theorems? | Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Proving Termination by Dependency Pairs and Inductive Theorem Proving Carsten Fuhs · J¨DocID: 1reYE - View Document |
| The 2006 Federated Logic Conference The Seattle Sheraton Hotel and Towers Seattle, Washington August, 2006 IJCAR WorkshopDocID: 1oIBk - View Document |
| Can the computer really help us to prove theorems?DocID: 1lK2e - View Document |
| CLASE 2005 Preliminary Version Constructing Induction Rules for Deductive Synthesis Proofs Alan Bundy† 1,2 Lucas Dixon† 3 Jeremy Gow‡ 4 Jacques Fleuriot† 5DocID: 1kPXX - View Document |
| RAC Rev. R. Acad. Cien. Serie A. Mat. VOL), 2004, pp. 153–180 Ciencias de la Computaci´on / Computational SciencesDocID: 1kPRp - View Document |