Journal of Philosophical Logic 25 (1):101 - 108 (1996)
A four-valued matrix is presented which validates all theorems of the implicational fragment, IF, of the classical sentential calculus in which at most two distinct sentence letters occur. The Wajsberg/Diamond-McKinsley Theorem for IF follows as a corollary: every complete set of axioms (with substitution and detachment as rules) must include at least one containing occurrences of three or more distinct sentence letters. Additionally, the matrix validates all IF theses built from nine or fewer occurrences of connectives and letters. So the classic result of Jagkovski for the full sentential calculus -that every complete axiom set must contain either two axioms of length at least nine or else one of length at least eleven-can be improved in the implicational case: every complete axiom set for IF must contain at least one axiom eleven or more characters long. Both results are "best possible", and both apply as well to most subsystems of IF, e.g., the implicational fragments of the standard relevance logics, modal logics, the relatives of implicational intutionism, and logics in the Lukasiewicz family
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
On the Number of Variables in the Axioms.M. D. Gladstone - 1970 - Notre Dame Journal of Formal Logic 11 (1):1-15.
Citations of this work BETA
No citations found.
Similar books and articles
The Shortest Axioms of the Implicational Calculus.Richard Tursman - 1968 - Notre Dame Journal of Formal Logic 9 (4):351-358.
Interpretations of Classical Implicational Sentential Calculus in Nonclassical Implicational Calculi.Tadeusz Prucnal - 1974 - Studia Logica 33 (1):59 - 64.
Relevant Implication and the Weak Deduction Theorem.Diderik Batens - 1987 - Studia Logica 46 (3):239 - 245.
Finding Missing Proofs with Automated Reasoning.Branden Fitelson & Larry Wos - 2001 - Studia Logica 68 (3):329-356.
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus.Larry Wos, Dolph Ulrich & Branden Fitelson - unknown
Final Word on a Shortest Implicational Axiom.Ivo Thomas - 1970 - Notre Dame Journal of Formal Logic 11 (1):16-16.
Independence of Two Nice Sets of Axioms for the Propositional Calculus.T. Thacher Robinson - 1968 - Journal of Symbolic Logic 33 (2):265-270.
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus.Branden Fitelson - manuscript
Shortest Axiomatizations of Implicational S4 and S.Zachary Ernst, Branden Fitelson, Kenneth Harris & Larry Wos - 2002 - Notre Dame Journal of Formal Logic 43 (3):169-179.
Shortest Axiomatizations of Implicational S4 and S5.Branden Fitelson - 2002 - Notre Dame Journal of Formal Logic 43 (3):169-179.
Added to index2009-01-28
Total downloads19 ( #249,104 of 2,146,236 )
Recent downloads (6 months)5 ( #162,891 of 2,146,236 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.