scientific article; zbMATH DE number 3880145

From MaRDI portal
Publication:3345811





[For the entire collection see Zbl 0545.00023.] This article consists of three parts: A tutorial introduction to a computer program that proves theorems by induction; a brief description of recent applications of that theorem-prover; and a discussion of several nontechnical aspects of the problem of building automatic theorem-provers. The theorem-prover described has proved theorems such as the uniqueness of prime factorizations, Fermat's theorem, and the recursive unsolvability of the halting problem.




Cited in
(40)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3345811)