Notes on the life of Adolf Lindenbaum, a complete bibliography of his published works, and selected references to his unpublished results.

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 life and work of Moj?esz Presburger (1904?1943?) are summarised in this article. Although his production in logic was small, it had considerable impact, both his own researches and his editions of lecture notes of Adjukiewicz and ?ukasiewicz. In addition, the surviving records of his student time at Warsaw University provide information on a little-studied topic.

In this contribution we shall characterize matrix consequence operation determined by a direct product and an ultraproduct of a family of logical matrices. As an application we shall describe finite consequence operations with the help of ultrapowers.

This paper revisits the life of Adolf Lindenbaum in light of new research findings, then looks at two areas among many—metric spaces, and decompositions of point sets—where his work has been underappreciated.

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)

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.

. 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 [1]. (shrink)

In this paper being a sequel to our [1] 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)

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.

This paper describes the work of the Polish logician Jan Kalicki (1922?1953). After a biographical introduction, his work on logical matrices and equational logic is appraised. A bibliography of his papers and reviews is also included.

The purpose of this article is to highlight a selected few of Alfred Tarski's career achievements. The choice of these achievements is subjective. Section 1 is a general sketch of his life and work, emphasizing his role as researcher, teacher, organizer and founder of a scientific school. Section 2 discusses his contributions to set theory. Section 3 discusses his contributions to the foundations of geometry and to measure theory. Section 4 looks at his metamathematical work, and especially the decision problem (...) for formalized theories. Section 5 is a selected bibliography to illustrate Sects. 1–4. (shrink)

In this paper we extend some techniques from the theory of conse- quences operations and logical matrices into the wider area of entailment relations.

This is an abstract of the paper accepted for publication in \Acta Uni- versitatis Wratislaviensis", series \Prace Filozoczne { Logika". The paper was presented at the 25th Conference for the History of Logic, Krakow, October 5-7, 1979.