Article contents
S3(S) = S3.5
Published online by Cambridge University Press: 12 March 2014
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
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1968
References
Biblography
- 2
- Cited by