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. (shrink)
The present work refers directly to the investigations of Buszkowski and Prucnal  and that of Esakia , generalizing their results. Our main representation theorem for co-diagonalizable algebras is obtained by application of certain methods taken from J´onsson-Tarski .
The aim of this note is to give an example of application of model theory to the theory of logical matrices. . More precisely, we show that Wojtylak's representation theorem is an immediate consequence of a result due to Mal'cev . Throughout the present note we assume that matrices, and classes of matrices under consideration are of the same xed similarity type. Suppose that K is an arbitrary class of matrices, and M is a matrix . We say that M1 (...) 2 K is called a replica of M in the class K i there is a homomorphism h of M onto M1 such that for every homomorphism g of M into arbitrary N 2 K there exists a homomorphism f of M1 into N such that g = f h. (shrink)
The present paper is to be considered as a sequel to , . 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. (shrink)
. In our paper, presented here in abstract form, we consider the sentential logic with semi-negation. It should be stressed, however, that our main interest is not that logic itself but rather more general matters concerning the theory of matrix semantics for sentential logics. The logic with semi-negation provides a relevant example for elucidating such basic notions of matrix semantics as degree of complexity, degree of uniformity, and self-referentiality. Thus our paper being a contribution to the theory of matrix semantics (...) may be treated as a sequel to . (shrink)
x1. This paper is a contribution to matrix semantics for sentential logics as presented in Los and Suszko  and Wojcicki , . 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.
The notion of a conditionally distributive lattice was introduced by B. Wolniewicz while formally investigating the ontology of situations . In several of this lectures he has appealed for a study of that class of lattices. The present abstract is a response to that request.
In this paper being a sequel to our  the logic with semi-negation is chosen as an example to elucidate some basic notions of the semantics for sentential calculi. E.g., there are shown some links between the Post number and the degree of complexity of a sentential logic, and it is proved that the degree of complexity of the sentential logic with semi-negation is 20. This is the first known example of a logic with such a degree of complexity. The (...) results of the final part of the paper cast a new light on the scope of the Kripke-style semantics in comparison to the matrix semantics. (shrink)
This abstract is a contribution to the paper by R. Wojcicki . We use the terminology introduced there, . In this note we show that 1 0 For each n 2 there exists a logic whose degree of uniformity and degree of complexity are both equal to n. 2 0 There is a logic with the degree of uniformity equal to 2 @0 but with the degree of complexity equal to @0.