# Automation of Reasoning

## 2: Classical Papers on Computational Logic 1967–1970

- Editors
- (view affiliations)

Part of the Symbolic Computation book series (SYMBOLIC)

Advertisement

- Editors
- (view affiliations)

Part of the Symbolic Computation book series (SYMBOLIC)

"Kind of crude, but it works, boy, it works!" AZan NeweZZ to Herb Simon, Christmas 1955 In 1954 a computer program produced what appears to be the first computer generated mathematical proof: Written by M. Davis at the Institute of Advanced Studies, USA, it proved a number theoretic theorem in Presburger Arithmetic. Christmas 1955 heralded a computer program which generated the first proofs of some propositions of Principia Mathematica, developed by A. Newell, J. Shaw, and H. Simon at RAND Corporation, USA. In Sweden, H. Prawitz, D. Prawitz, and N. Voghera produced the first general program for the full first order predicate calculus to prove mathematical theorems; their computer proofs were obtained around 1957 and 1958, about the same time that H. Gelernter finished a computer program to prove simple high school geometry theorems. Since the field of computational logic (or automated theorem proving) is emerging from the ivory tower of academic research into real world applications, asserting also a definite place in many university curricula, we feel the time has corne to examine and evaluate its history. The article by Martin Davis in the first of this series of volumes traces the most influential ideas back to the 'prehistory' of early logical thought showing how these ideas influenced the underlying concepts of most early automatic theorem proving programs.

Automation Extension Principia Mathematica Resolution algorithms automated theorem proving complexity computer proof heuristics logic mathematics proof proving theorem proving type theory

- DOI https://doi.org/10.1007/978-3-642-81955-1
- Copyright Information Springer-Verlag Berlin Heidelberg 1983
- Publisher Name Springer, Berlin, Heidelberg
- eBook Packages Springer Book Archive
- Print ISBN 978-3-642-81957-5
- Online ISBN 978-3-642-81955-1
- Buy this book on publisher's site