On Theses Without Iterated Modalities of Modal Logics Between C1 and S5. Part 1
MetadataShow full item record
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 ,where he proved that all modal logics between S1 and S5 have the same theseswhich does not involve iterated modalities (i.e., the same first-degree theses).
Showing items related by title, author, creator and subject.
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 ...
Jarmużek, Tomasz; Malinowski, Jacek (Wydawnictwo Uniwersytetu Łódzkiego, 2019-10-30)In this paper we investigate Boolean connexive logics in a language with modal operators: □, ◊. In such logics, negation, conjunction, and disjunction behave in a classical, Boolean way. Only implication is non-classical. ...
A New Arithmetically Incomplete First- Order Extension of Gl All Theorems of Which Have Cut Free Proofs Tourlakis, George (Wydawnictwo Uniwersytetu Łódzkiego, 2016)Reference  introduced a novel formula to formula translation tool (“formulators”) that enables syntactic metatheoretical investigations of first-order modal logics, bypassing a need to convert them first into Gentzen ...