Abstract
The Lewis systems of modal logic S1–5 were originally constructed as N-K-M systems, i.e. with the help of primitive operators for negation (N), conjunction (K) and possibility (M). As a result they are normally considered as strengthenings of classical two-valued logic (PC), since the axioms and rules of inference of PC are easily derivable in even the weakest of them. If, however, S1–5 are reformulated as C-N-K systems in which the primitive operator C of strict implication replaces M (the latter then being definable via the definition Mα = NCαNα), the Lewis systems appear in quite a different light. Since every thesis which holds of strict implication holds also of material implication (but not vice versa), S1–5 emerge as progressively stricter fragments of PC rather than as containing it. Furthermore, they are then properly speaking systems of propositional logic rather than systems of modal logic, though of course the modal operators L and M are definable in them, and their characteristic modal theses derivable. Although Lewis (with an assist from Hugh MacColl) is the founder of modern modal logic, there is good evidence that he himself preferred to regard the Lewis systems as formalizations of the notion of implication rather than of possibility and necessity: furthermore, the notion of implication Lewis had in mind was arrived at by restricting and so to speak cutting some of the fat off material implication. Hence Lewis would approve of the treatment of his systems in this paper.
The authors would like to thank A. T. Tymoczko of Harvard University and the members of philosophy 292, University of Pittsburgh, 1967 (especially Mr. Karatay, Mr. Pottinger, Miss Roper and Miss Smith) for help with the axiomatization of matrix 1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
W. Ackermann, ’Begründung einer strengen Implikation9, The Journal of Symbolic Logic [JSL] 21 (1956) 113–128.
M. J. Alban, ’Independence of the Primitive Symbols of Lewis Calculi of Propositions’, JSL 8 (1943) 25–26.
A. R. Anderson, ’Decision Procedures for Lewis’s Calculus S3 and Three Extensions Thereof (abstract), JSL 19 (1954) 154.
A. R. Anderson and N. D. Belnap, Jr., ’The Pure Calculus of Entailment’, JSL 27 (1962) 19–52.
A. R. Anderson and N. D. Belnap, Jr., Entailment (forthcoming).
L. Åqvist, ’Results concerning Some Modal Systems that Contain S2’, JSL 29 (1964) 79–87.
N. D. Belnap, Jr. and S. McCall, ’Every Functionally Complete m-Valued Logic has a Post-Complete Axiomatization’ (forthcoming).
M. J. Cresswell, ’Note on a System of Åqvist’, JSL 32 (1967) 58–60.
J. Dugundji, ’Note on a Property of Matrices for Lewis and Langford’s Calculi of Propositions’, JSL 5 (1940) 150–151.
K. Gödel, ’Zum intuitionistischen Aussagenkalkül’, Ergebnisse eines mathematischen Kolloquiums 4 (1933) 34–38.
S. Halldén, ’Results concerning the Decision Problem of Lewis’s Calculi S3 and S6’. JSL 14 (1949) 230–236.
S. Halldén, ’On the Semantic Non-Completeness of Certain Lewis Calculi’ JSL 16 (1951) 127–129.
S. Kripke, ’Semantical Analysis of Modal Logic’ (abstract), JSL 24 (1959) 323–324.
S. Kripke, ’Semantical Analysis of Modal Logic II: Non-Normal Modal Propo-
sitional Calculi’, in The Theory of Models (ed. by Addison, Henkin and Tarski), Amsterdam 1965, pp. 206–220.
E. J. Lemmon, C. A. Meredith, D. Meredith, A. N. Prior and I. Thomas, Calculi of Pure Strict Implication, 1956 (mimeographed). See also in the present Volume p. 215.
E. J. Lemmon, ’Some Results on Finite Axiomatizability in Modal Logic’, Notre Dame Journal of Formal Logic (NDJFL), 6 (1965) 301–308.
C. I. Lewis and C. H. Langford, Symbolic Logic, New York 1932.
S. McCall, ’Connexive Implication’, JSL 31 (1966) 415–433.
S. McCall, ’A Non-classical Theory of Truth, with an Application to Intuitionism’, forthcoming in the American Philosophical Quarterly.
J. C. C. McKinsey, ‘A Solution of the Decision Problem for the Lewis Systems S2 and S4, with an Application to Topology’, JSL 6 (1941) 117–134.
J. C. C. McKinsey, ‘On the Number of Complete Extensions of the Lewis Systems of Sentential Calculus’, JSL 9 (1944) 42–46.
J. C. C. McKinsey, ‘Systems of Modal Logic which are not Unreasonable in the Sense of Halldén’, JSL 18 (1953) 109–113.
A. N. Prior, Formal Logic, 2nd ed., Oxford 1962.
A. N. Prior, Time and Modality, Oxford 1957.
J. Shipecki, ’The Full Three-Valued Propositional Calculus’ (1936), translated in Polish Logic (ed. by McCall), Oxford 1967, pp. 335–337.
B. Sobociński, ’A Note on the Regular and Irregular Modal Systems of Lewis’, NDJFL 3 (1962) 109–113.
References
Lemmon’s proof is given for S2 (and for T — see below) as an N-K-M system, but can be adapted to C-N-K form.
A useful survey of the systems S1–8 is to be found in [24], pp. 123–125.
The possibility of constructing these definitions of M and L in the Lewis systems is grounded in theorem 18.14 of [17], p. 160.
The reason why Dugundji did not himself extend his proof to S7 and S8 was presumably that those systems were not current at the time. His argument is however easily extendible.
One might think that arguments similar to Halldén’s could be used to prove that S2 is the intersection of S6 and T, but Åqvist in [6] showed this to be untrue.
There are to the best of the authors’ knowledge only two other Post-complete C-N-Ksystems which are so far known: PC and the system CCI of [18]. All three have finite characteristic matrices. It would be interesting to discover whether there existed a Post-complete system with no finite characteristic matrix.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1969 D. Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Mccall, S., Vander Nat, A. (1969). The System S9. In: Davis, J.W., Hockney, D.J., Wilson, W.K. (eds) Philosophical Logic. Synthese Library, vol 20. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-9614-0_16
Download citation
DOI: https://doi.org/10.1007/978-94-010-9614-0_16
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-9616-4
Online ISBN: 978-94-010-9614-0
eBook Packages: Springer Book Archive