A Computing Procedure for Quantification Theory

  title={A Computing Procedure for Quantification Theory},
  author={Martin D. Davis and Hilary Putnam},
  journal={J. ACM},
The hope that mathematical methods employed in the investigation of formal logic would lead to purely computational methods for obtaining mathematical theorems goes back to Leibniz and has been revived by Peano around the turn of the century and by Hilbert's school in the 1920's. Hilbert, noting that all of classical mathematics could be formalized within quantification theory, declared that the problem of finding an algorithm for determining whether or not a given formula of quantification… 
In 1936 Alan Turing and Alonzo Church proved two theorems which seemed to have destroyed all hopes of establishing a method of mechanizing reasonings, but the idea of applying them to the automatization of logic by using the mechanization procedures developed earlier is described.
The Complexity of Propositional Proofs
  • A. Urquhart
  • Computer Science, Mathematics
    Bulletin of Symbolic Logic
  • 1995
A survey of the field, and of some of the techniques that have proved successful in deriving lower bounds on the complexity of proofs, of the classical propositional calculus and its relation to bounded arithmetic.
Theorem-Proving on the Computer
The paper discusses the "combinatorial explosion" difficulties encountered by computer programs embodying proof-construction procedures, and a program developed at Argonne National Laboratory is described in which these difficulties are somewhat alleviated in two ways.
Tableau Methods for Classical Propositional Logic
The deducibility problem of classical propositional logic was already ‘closed’ in the early 1920’s, when Wittgenstein and Post independently devised the well-known decision procedure based on the truth-tables.
Automated theorem proving methods
This article takes a broad view of the development of automated theorem proving and stresses the contributions of Löwenheim, Skolem and Prawitz as the most decisive influences towards efficient computational methods.
Combined Decision Techniques for the Existential Theory of the Reals
RAHD (“Real Algebra in High Dimensions”) is a theorem prover that works to combine a collection of real algebraic decision methods in ways that exploit their respective “sweet-spots” and is discussed high-level mathematical and design aspects.
A History of Satisfiability
This chapter traces the links between the notion of Satisfiability and the attempts by mathematicians, philosophers, engineers, and scientists over the last 2300 years to develop effective processes
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving*
In recent years the idea of using electronic computers to search for proofs of theorems of quantification theory has drawn considerable attention. One of the more successful methods of attack on the
Combined Decision Techniques for the Existential Theory of the Reals
RAHD ("Real Algebra in High Dimensions") is a theorem prover that works to combine a collection of real algebraic decision methods in ways that exploit their respective "sweet-spots" and illustrate its use on a number of examples.


A proof procedure for quantification theory
  • W. Quine
  • Philosophy
    Journal of Symbolic Logic
  • 1955
The procedure will take the form of a method for proving a quantificational schema to be inconsistent, i.e., satisfiable in no non-empty universe, and serves equally for proving validity, since the authors can show a schema valid by showing its negation inconsistent.
Toward Mechanical Mathematics
Results are reported here of a rather successful attempt at proving all theorems, totalling near 400, of Principia Mathematica which are strictly in the realm of logic, viz., the restricted predicate
A Proof Method for Quantification Theory: Its Justification and Realization
A program is described which can provide a computer with quick logical facility for syllogisms and moderately more complicated sentences. The program realizes a method for proving that a sentence of
Methods of Logic
This widely used textbook of modern formal logic now offers a number of new features, including an introduction to all pattabhi jois lived and a deductive model on a theory because it requires dedication.
Computability and Unsolvability
  • Martin D. Davis
  • Computer Science
    McGraw-Hill Series in Information Processing and Computers
  • 1958
Only for you today! Discover your favourite computability and unsolvability book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book
Towards mechanical mathematics
  • IBM J. Research Dev
  • 1960
Towards mechanical mathematics
  • IBM J. Research Dev
  • 1960
GILMOre , A proof method for quantification theory
  • IBM J . Research Dev .
  • 1960