Summary
Of every formal system it is desirable to show that the system is (1) consistent, and (2) complete.2 This is shown for the system PLT’ in this chapter. A decision procedure is first developed for PLT’ and by means of this, the desired results are demonstrated. It will be shown that (a) every theorem of PLT’ is a tautology and that every tautology of propositionallogic is a theorem of PLT’. The results thus derived will be extended to the system PLT. Of P + it will be shown that while the system is consistent (in an appropriate sense) it is not complete.
In the Introduction it was shown that the primitive rules of the system PLT’, substitution and modus ponens, were L-truth-preserving, i.e., that if the premises of a proof are L-true then the conclusion is L-true. (In this chapter the term “L-true” is used interchangeably with the term “tautology”.) This being the case, it is possible to establish the following metatheorem concerning PLT’.
(The present chapter is more difficult than its predecessors. Consequently it may be passed over by those using the work as an elementary text book in symbolic logic.)
The metalogical proofs here presented employ methods due to Post, Kalmár and Church.
In S-systems substantially more comprehensive than the propositional calculus (e.g., LF’LT of Ch. 7), these desiderata cannot both be obtained.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1966 D. Reidel Publishing Company
About this chapter
Cite this chapter
Hackstaff, L.H. (1966). The Consistency and Completeness of Formal Systems. In: Systems of Formal Logic. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-3547-7_5
Download citation
DOI: https://doi.org/10.1007/978-94-010-3547-7_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3549-1
Online ISBN: 978-94-010-3547-7
eBook Packages: Springer Book Archive