Hostname: page-component-848d4c4894-x5gtn Total loading time: 0 Render date: 2024-05-26T10:37:12.363Z Has data issue: false hasContentIssue false

S3(S) = S3.5

Published online by Cambridge University Press:  12 March 2014

M. K. Rennie*
Affiliation:
University of Auckland, New Zealand

Extract

In this note a proof is supplied of a fairly easily-made conjecture: that the system S3.5, formulated by Åqvist in [1] and proved complete with respect to some Kripke-style semantics by Cresswell in [2], is indeed the same system as S3(S), formulated by Lemmon in [3]. Any otherwise unexplained terms and notation are taken from the latter two papers.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1968

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

Biblography

[1]Åqvist, Lennart, Results concerning some modal systems that contain S2, this Journal vol. 29 (1964), pp. 7987.Google Scholar
[2]Cresswell, M. J., Note on a system of Åqvist, this Journal, vol. 32 (1967), pp. 5860.Google Scholar
[3]Lemmon, E. J., Algebraic semantics for modal logics. I, II, this Journal, vol. 31 (1966), pp. 4665, pp. 191–218.Google Scholar