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

Andrzej Pietruszczak

Bulletin of the Section of Logic (2017)

  • Volume: 46, Issue: 3/4
  • ISSN: 0138-0680

Abstract

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

How to cite

top

Andrzej Pietruszczak. "On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2." Bulletin of the Section of Logic 46.3/4 (2017): null. <http://eudml.org/doc/295511>.

@article{AndrzejPietruszczak2017,
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).},
author = {Andrzej Pietruszczak},
journal = {Bulletin of the Section of Logic},
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},
language = {eng},
number = {3/4},
pages = {null},
title = {On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2},
url = {http://eudml.org/doc/295511},
volume = {46},
year = {2017},
}

TY - JOUR
AU - Andrzej Pietruszczak
TI - On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2
JO - Bulletin of the Section of Logic
PY - 2017
VL - 46
IS - 3/4
SP - null
AB - 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).
LA - eng
KW - 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
UR - http://eudml.org/doc/295511
ER -

References

top
  1. [1] J. L. Pollack, Basic Modal Logic, The Journal of Symbolic Logic 32 (3) (1967), pp. 355–365. DOI: 10.2307/2270778 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.