Implementing Metamathematics as an Approach to Automatic Theorem Proving
| dc.contributor.author | Constable, Robert L. | en_US |
| dc.contributor.author | Howe, Douglas J. | en_US |
| dc.date.accessioned | 2007-04-23T17:42:44Z | |
| dc.date.available | 2007-04-23T17:42:44Z | |
| dc.date.issued | 1989-04 | en_US |
| dc.description.abstract | A simple but important algorithm used to support automated reasoning is called matching: given two terms it produces a substitution, if one exists, that maps the first term to the second. In this paper the matching algorithm is used to illustrate the approach to automating reasoning suggested in the title. In Section 3 the algorithm is derived and verified in the Nuprl proof development system following exactly an informal presentation of it in Section 2. The example serves to introduce a particular automated reasoning system, Nuprl, as well as the idea of deriving programs from constructive proofs. The treatment of this example also suggests how these systems can be soundly extended by the addition of constructive metatheorems about themselves to their libraries of results. | en_US |
| dc.format.extent | 3398473 bytes | |
| dc.format.extent | 708738 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-982 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6898 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Implementing Metamathematics as an Approach to Automatic Theorem Proving | en_US |
| dc.type | technical report | en_US |