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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
25 (#540,419)

6 months
1 (#1,028,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations