comments

Boyer-Moore theorem prover

A LISP-driven theorem proving engine that has been used to derive many novel mathematical results, including decisions on some open questions in mathematics.

R. S. Boyer and J. S. Moore (1979).
RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
⌃
Improved machines
⌃
The Gödelian insight has already been formalised
⌃
Gödelization procedure algorithmically specifiable
⌃
Proof has been formalised into a program
■
Boyer-Moore theorem prover
□
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip