A theorem of the degree of complexity of some sentential logics

Bulletin of the Section of Logic 9 (2):67-69 (1980)
  Copy   BIBTEX

Abstract

x1. This paper is a contribution to matrix semantics for sentential logics as presented in Los and Suszko [1] and Wojcicki [3], [4]. A generalization of Lindenbaum completeness lemma says that for each sentential logic there is a class K of matrices of the form such that the class is adequate for the logic, i.e., C = CnK

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: 106,756

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
2014-02-19

Downloads
49 (#502,120)

6 months
6 (#745,101)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations