Pokaż uproszczony rekord

dc.contributor.authorPietruszczak, Andrzej
dc.date.accessioned2018-06-22T13:54:33Z
dc.date.available2018-06-22T13:54:33Z
dc.date.issued2017
dc.identifier.issn0138-0680
dc.identifier.urihttp://hdl.handle.net/11089/25177
dc.description.abstractThis 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).en_GB
dc.language.isoenen_GB
dc.publisherWydawnictwo Uniwersytetu Łódzkiegoen_GB
dc.relation.ispartofseriesBulletin of the Section of Logic;3/4
dc.subjectfirst-degree theses of modal logicsen_GB
dc.subjecttheses without iterated modalitiesen_GB
dc.subjectPollack’s theory of Basic Modal Logicen_GB
dc.subjectbasic theories for modal logics between C1 and S5en_GB
dc.titleOn Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2en_GB
dc.typeArticleen_GB
dc.rights.holder© Copyright by Authors, Łódź 2017; © Copyright for this edition by Uniwersytet Łódzki, Łódź 2017en_GB
dc.page.number197–218
dc.contributor.authorAffiliationNicolaus Copernicus University in Toruń, ul. Moniuszki 16, 87–100 Toruń, Poland
dc.identifier.eissn2449-836X
dc.referencesJ. L. Pollack, Basic Modal Logic, The Journal of Symbolic Logic 32 (3) (1967), pp. 355–365. DOI: 10.2307/2270778en_GB
dc.contributor.authorEmailAndrzej.Pietruszczak@umk.pl
dc.identifier.doi10.18778/0138-0680.46.3.4.03
dc.relation.volume46en_GB


Pliki tej pozycji

Thumbnail

Pozycja umieszczona jest w następujących kolekcjach

Pokaż uproszczony rekord