Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-20T00:44:42.405Z Has data issue: false hasContentIssue false

Results concerning same modal systems that contain S2

Published online by Cambridge University Press:  12 March 2014

Extract

It is well known that if a postulate LLCpp or a rule of procedure ├α→├Lα (from a thesis α of a considered system to infer a thesis of that system) is added to Lewis's modal system S3, we get his system S4 (see [7], p. 148). It is also known that the addition of this rule to S2 and SI has the effect of converting these systems into the Gödel-Feys-von Wright system T (M). My purpose in this paper is first to draw attention to some other ways of converting S3 and S2 into S4 and T respectively, as well as to extend a theorem of Halldén on S3, S4 and S7 to S2, T and S6. The results reached will also apply to the systems S3.5, S5 and S7.5, where S3.5 and S7.5 are obtained, respectively, from S3 and S7 by the addition of the postulate CNLpLNLp; an answer will be given to the question of irreducible modalities in S3.5. Moreover, two results will be proved that bear on the problem whether the systems S2 and T can be axiomatized by means of a finite number of axiom schemata and material detachment as the only primitive rule of inference.

Type
Articles
Copyright
Copyright © Association for Symbolic Logic 1964

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.)

References

[1]Halldén, S., Results concerning the decision problem of Lewis's calculi S3 and So, this Journal, vol. 14 (1949), pp. 230236.Google Scholar
[2]Halldén, S., On the semantic non-completeness of certain Lewis calculi, this Journal, vol. 16 (1951), pp. 127129.Google Scholar
[3]Lemmon, E. J., New foundations for Lewis modal systems, this Journal, vol. 22 (1957), pp. 176186.Google Scholar
[4]Lewis, C. I. and Langford, C. H., Symbolic logic, New York 1932.Google Scholar
[5]Mc, J. C. C.Kinsey and Tarski, A., Some theorems about the sentential calculi of Lewis and Heyting, this Journal, vol. 13 (1948), pp. 115.Google Scholar
[6]Parry, W. T., The postulates for “strict implication”, Mind, vol. 43 (1934), pp. 7880.CrossRefGoogle Scholar
[7]Parry, W. T., Modalities in the Survey system of strict implication, this Journal, vol. 4 (1939), pp. 137154.Google Scholar
[8]Prior, A. N., Time and modality, Oxford 1957.Google Scholar
[9]Shaw-Kwei, Moh, The deduction theorems and two new logical systems, Methodes, vol. 2 (1950), pp. 5675.Google Scholar
[10]Sobociński, B., Note on a modal system of Feys-von Wright, Journal of computing systems, vol. 1: 3 (1953), pp. 171178.Google Scholar