On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2

Authors

  • Andrzej Pietruszczak Nicolaus Copernicus University in Toruń, ul. Moniuszki 16, 87–100 Toruń, Poland

DOI:

https://doi.org/10.18778/0138-0680.46.3.4.03

Keywords:

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 S5

Abstract

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

2017-12-30

How to Cite

Pietruszczak, A. (2017). On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2. Bulletin of the Section of Logic, 46(3/4), 197–218. https://doi.org/10.18778/0138-0680.46.3.4.03

Issue

Section

Research Article