On the degree of complexity of sentential logics, III. An example of Johansson's minimal logic

Studia Logica 46 (4):283 - 289 (1987)
  Copy   BIBTEX

Abstract

The present paper is to be considered as a sequel to [1], [2]. It is known that Johansson's minimal logic is not uniform, i.e. there is no single matrix which determines this logic. Moreover, the logic C J is 2-uniform. It means that there are two uniform logics C 1, C 2 (each of them is determined by a single matrix) such that the infimum of C 1 and C 2 is C J. The aim of this paper is to give a detailed description of the logics C 1 and C 2. It is performed in a lattice-theoretical language.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Filter distributive logics.Janusz Czelakowski - 1984 - Studia Logica 43 (4):353 - 377.
On the Beth properties of some intuitionistic modal logics.C. Luppi - 2002 - Archive for Mathematical Logic 41 (5):443-454.
On the degree of matrix complexity.Jacek Hawranek - 1984 - Bulletin of the Section of Logic 13 (2):50-52.
Kripke bundle semantics and c-set semantics.Eiko Isoda - 1997 - Studia Logica 58 (3):395-401.

Analytics

Added to PP
2009-01-28

Downloads
37 (#609,859)

6 months
10 (#407,001)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Semantics without Toil? Brady and Rush Meet Halldén.Lloyd Humberstone - 2019 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 26 (3):340–404.

Add more citations