There are exactly two nonfinitely axiomatizable algebraic matrices with one binary connective o such thatx(yz) is a tautology of . This answers a question asked by W. Rautenberg in [2], P. Wojtylak in [8] and W. Dziobiak in [1]. Since every 2-element matrix can be finitely axiomatized ([3]), the matrices presented here are of the smallest possible size and in some sense are the simplest possible.

Artykuł jest celnym przeglądem metod dowodzenia twierdzeń o stopniach maksymalności i rezultatów uzyskanych w tej dziedzinie do 1979 r.

In [2] A. Wroski proved that there is a strongly finite consequence C which is not finitely based i.e. for every consequence C + determined by a finite set of standard rules C C +. In this paper it will be proved that for every strongly finite consequence C there is a consequence C + determined by a finite set of structural rules such that C(Ø)=C +(Ø) and = (where , are consequences obtained by adding to the rules of C, (...) C + respectively the rule of substitution). Moreover it will be shown that under certain assumptions C=C +. (shrink)

In this paper we start an investigation of a logic called the logic of algebraic rules. The relation of derivability of this logic is defined on universal closures of special disjunctions of equations extending the relation of derivability of the usual equational logic. The paper contains some simple theorems and examples given in justification for the introduction of our logic. A number of open questions is posed.

First, we prove that the lattice of all structural strengthenings of a given strongly finite consequence operation is both atomic and coatomic, it has finitely many atoms and coatoms, each coatom is strongly finite but atoms are not of this kind — we settle this by constructing a suitable counterexample. Second, we deal with the notions of hereditary: algebraicness, strong finitisticity and finite approximability of a strongly finite consequence operation. Third, we formulate some conditions which tell us when the lattice (...) of all structural strengthenings of a given strongly finite consequence operation is finite, and subsequently we give some applications of them. (shrink)

Using ideas from Murskii [3], Tokarz [4] and Wroski [7] we construct some strongly finite consequence operation having 2%0 standard strengthenings. In this way we give the affirmative answer to the following question, stated in Tokarz [4]: are there strongly finite logics with the degree of maximality greater than 0?

The aim of the article is to outline the historical background and the present state of the methodology of deductive systems invented by Alfred Tarski in the thirties. Key notions of Tarski's methodology are presented and discussed through, the recent development of the original concepts and ideas.