On Theses Without Iterated Modalities of Modal Logics Between C1 and S5. Part 1
Abstract
This is the first, out of two papers, in which we identify all logics between C1 and S5 having the same theses without iterated modalities. All these logics canbe divided into certain groups. Each such group depends only on which of thefollowing 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 [12],where he proved that all modal logics between S1 and S5 have the same theseswhich does not involve iterated modalities (i.e., the same firstdegree theses).
Collections
Related items
Showing items related by title, author, creator and subject.

On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2
Pietruszczak, Andrzej (Wydawnictwo Uniwersytetu Łódzkiego, 2017)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 ... 
A New Arithmetically Incomplete First Order Extension of Gl All Theorems of Which Have Cut Free Proofs
Tourlakis, George (Wydawnictwo Uniwersytetu Łódzkiego, 2016)Reference [12] introduced a novel formula to formula translation tool (“formulators”) that enables syntactic metatheoretical investigations of firstorder modal logics, bypassing a need to convert them first into Gentzen ... 
Logics with Impossibility as the Negation and Regular Extensions of the Deontic Logic D2
MruczekNasieniewska, Krystyna; Nasieniewski, Marek (Wydawnictwo Uniwersytetu Łódzkiego, 2017)In [1] J.Y. Bèziau formulated a logic called Z. Bèziau’s idea was generalized independently in [6] and [7]. A family of logics to which Z belongs is denoted in [7] by K. In particular; it has been shown in [6] and [7] ...