On the degree of complexity of sentential logics. A couple of examples

Studia Logica 40 (2):141 - 153 (1981)
  Copy   BIBTEX

Abstract

The first part of the paper is a reminder of fundamental results connected with the adequacy problem for sentential logics with respect to matrix semantics. One of the main notions associated with the problem, namely that of the degree of complexity of a sentential logic, is elucidated by a couple of examples in the second part of the paper. E.g., it is shown that the minimal logic of Johansson and some of its extensions have degree of complexity 2. This is the first example of an exact estimation of the degree of natural complex logics, i.e. logics whose deducibility relation cannot be represented by a single matrix. The remaining examples of complex logics are more artificial, having been constructed for the purpose of checking some theoretical possibilities.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,641

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

Analytics

Added to PP
2009-01-28

Downloads
57 (#412,302)

6 months
10 (#383,830)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jan Zygmunt
University of Wroclaw

References found in this work

Investigations into the sentential calculus with identity.Roman Suszko & Stephen L. Bloom - 1972 - Notre Dame Journal of Formal Logic 13 (3):289-308.
Decidability of S4.1.Krister Segerberg - 1968 - Theoria 34 (1):7-20.
Deducibility and many-valuedness.D. J. Shoesmith & T. J. Smiley - 1971 - Journal of Symbolic Logic 36 (4):610-622.

View all 13 references / Add more references