Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T21:04:36.832Z Has data issue: false hasContentIssue false

Completeness of the propositional calculus

Published online by Cambridge University Press:  12 March 2014

W. V. Quine*
Affiliation:
Harvard University

Extract

The completeness of the prepositional calculus was first proved by Post. His somewhat condensed proof has been succeeded by more detailed presentations of substantially the same argument, and also by several proofs of radically different forms. The present paper contains still another proof, offered because of its relative simplicity. In part this proof follows a plan which was sketched by Wajsberg for another purpose, viz. for proving the completeness of the sub-calculus involving only the material conditional.

For the present proof a systematization of the propositional calculus will be used which is due to Tarski, Bernays, and Wajsberg. It involves the material conditional “⊃” and the falsehood “F” as primitive; thus the formulae are recursively describable as comprising “F”, the variables “p”, “q”, “r”, …, and all results of putting formulae for “p” and “q” in “(p⊃q)”. The denial “˜p” is definable as “(p⊃F)”, and all other truth functions are then definable in familiar fashion. (Conversely, in a system admitting “˜” instead of “F” as primitive, “F” might be explained as an abbreviation of “˜(P⊃P)”.) The postulates are four:

(1) ((p⊃q)⊃((q⊃r)⊃ (p⊃ r)))

(2) (((p⊃(q⊃p)⊃p)

(3) (p⊃(q⊃p))

(4) (F⊃p).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1938

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable