Automation of Reasoning

2: Classical Papers on Computational Logic 1967–1970

  • Jörg H. Siekmann
  • Graham Wrightson

Part of the Symbolic Computation book series (SYMBOLIC)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Automated Theorem Proving 1965–1970

    1. L. Wos, L. Henschen
      Pages 1-24
  3. 1967

    1. Front Matter
      Pages 25-25
    2. R. W. Binkley, R. L. Clark
      Pages 27-47
    3. L. T. Wos, G. A. Robinson, D. F. Carson, L. Shalla
      Pages 66-81
  4. 1968

    1. Front Matter
      Pages 83-83
    2. P. B. Andrews
      Pages 85-101
    3. P. B. Andrews
      Pages 102-116
    4. J. A. Robinson
      Pages 135-151
    5. J. A. Robinson
      Pages 152-158
    6. N. G. de Bruijn
      Pages 159-200
  5. 1969

    1. Front Matter
      Pages 201-201
    2. J. R. Guard, F. C. Oglesby, J. H. Bennett, L. G. Settle
      Pages 203-216
    3. R. Kowalski, P. J. Hayes
      Pages 217-232

About this book

Introduction

"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.

Keywords

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

Editors and affiliations

  • Jörg H. Siekmann
    • 1
  • Graham Wrightson
    • 2
  1. 1.Institut für Informatik IUniversität KarlsruheKarlsruheWest Germany
  2. 2.Department of Information ScienceVictoria UniversityWellingtonNew Zealand

Bibliographic information

  • 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
  • About this book