A proof procedure for quantification theory
Author:
- 12 March 1955
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 20 (2) , 141-149
Abstract
The purpose of this paper is to present and justify a simple proof procedure for quantification theory. 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. But it serves equally for proving validity, since we can show a schema valid by showing its negation inconsistent.Method A, as I shall call it, will appear first, followed by a more practical adaptation which I shall call B. The soundness and completeness of A will be established, and the equivalence of A and B. Method A, as will appear, is not new.The reader need be conversant with little more than the fairly conventional use (as in [8]) of such terms as ‘quantificational schema’, ‘interpretation’, ‘valid’, ‘consistent’, ‘prenex’, and my notation (as in [7]) of quasi-quotation.Keywords
This publication has 5 references indexed in Scilit:
- Introduction to Metamathematics. By S. C. Kleene. Pp. x, 550, Fl. 32.50. 1952. (Noordhoff, Groningen; North-Holland Publishing Co., Amsterdam)The Mathematical Gazette, 1954
- On the Completeness of Quantification TheoryProceedings of the National Academy of Sciences, 1952
- Die Vollständigkeit der Axiome des logischen FunktionenkalkülsMonatshefte für Mathematik, 1930
- Zum Entscheidungsproblem der mathematischen LogikMathematische Annalen, 1928
- Über Möglichkeiten im RelativkalkülMathematische Annalen, 1915