On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2
DOI:
https://doi.org/10.18778/0138-0680.46.3.4.03Keywords:
first-degree theses of modal logics, theses without iterated modalities, Pollack’s theory of Basic Modal Logic, basic theories for modal logics between C1 and S5Abstract
This is the second, out of two papers, in which we identify all logics between C1 and S5 having the same theses without iterated modalities. All these logics can be divided into certain groups. Each such group depends only on which of the following formulas are theses of all logics from this group: (N), (T), (D), ⌜(T)∨☐q⌝, and for any n > 0 a formula ⌜(T) ∨ (altn)⌝, where (T) has not the atom ‘q’, and (T) and (altn) have no common atom. We generalize Pollack’s result from [1], where he proved that all modal logics between S1 and S5 have the same theses which does not involve iterated modalities (i.e., the same first-degree theses).
References
[1] J. L. Pollack, Basic Modal Logic, The Journal of Symbolic Logic 32 (3) (1967), pp. 355–365. DOI: 10.2307/2270778
Google Scholar
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2017 © Copyright by Authors, Łódź 2017; © Copyright for this edition by Uniwersytet Łódzki, Łódź 2017
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.