A Definition-Driven Theorem Prover

Ernst · IEEE Transactions on Computers · 1976

This paper describes a theorem prover, running on a PDP-10-Tenex system, that can prove some theorems whose statements involve a relatively large number of definitions. Such theorems require special methods because 1) their statements contain a large number of clauses and 2) their proofs are quite long although straightforward.

Read the paper · More papers on PaperTik