• polski
    • English
  • English 
    • polski
    • English
  • Login
View Item 
  •   DSpace Home
  • Czasopisma naukowe | Scientific Journals
  • Bulletin of the Section of Logic
  • Bulletin of the Section of Logic 46/3-4 (2017)
  • View Item
  •   DSpace Home
  • Czasopisma naukowe | Scientific Journals
  • Bulletin of the Section of Logic
  • Bulletin of the Section of Logic 46/3-4 (2017)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

View Usage Statistics

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

No Thumbnail [100%x80]
View/Open
0_3_197-218 Pietruszczak.pdf (203.6Kb)
Date
2017
Author
Pietruszczak, Andrzej
Metadata
Show full item record
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).
URI
http://hdl.handle.net/11089/25177
Collections
  • Bulletin of the Section of Logic 46/3-4 (2017) [7]

Related items

Showing items related by title, author, creator and subject.

  • On Theses Without Iterated Modalities of Modal Logics Between C1 and S5. Part 1 

    Pietruszczak, Andrzej (Wydawnictwo Uniwersytetu Łódzkiego, 2017)
    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 ...
  • Modal Boolean Connexive Logics: Semantics and Tableau Approach 

    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 [12] 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 ...

University of Lodz Repository

Contact Us | Send Feedback | Accessibility
 

 


University of Lodz Repository

Contact Us | Send Feedback | Accessibility
 

 

NoThumbnail