A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the completeness of the classical sentential logic
1958
Indagationes Mathematicae (Proceedings)
We consider a version of the classical sentential logic in which atoms p, q, r, ... , negation-, and implication--+ are used. It is well known that this subject may be approached in three ways: (A) We define the notion of a logical identity (tautology, or valid formula) by means of truth-tables for the· connectives-and --+. (B) We set up a calculus of sequents. (C) We select an axiom system and rules of deduction, and we consider the formulas deducible from the axioms. The completeness theorem
doi:10.1016/s1385-7258(58)50060-2
fatcat:xsplulvjjrcffhtpxy7i5x27pq