Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Dziobiak.A finite matrix whose set of tautologies is not finitely axiomatizable.Reports on Mathematical Logic 25 (1991), pp. 105–112.
W. Rautenberg.Klassische und nichtklassische Aussagenlogik, Vieweg, Wiesbaden, 1979.
W. Rautenberg.2-element matrices.Studia Logica 40 (1981), pp. 315–353.
W. Rautenberg.On Reduced Matrices,Studia Logica 52 (1993), pp. 63–72.
A. Urquhart.A finite matrix whose consequence relation is not finitely axiomatizable.Reports on Mathematical Logic 9 (1977), pp. 71–73.
R. Wójcicki.Theory of Logical Calculi, Kluwer, Dordrecht, 1989.
P. Wojtylak.Strongly finite logics: finite axiomatizability and the problem of supremum.Bulletin of the Section of Logic, Polish Academy of Sciences 8 (1979), pp. 99–111.
P. Wojtylak.An example of a finite though finitely non-axiomatizable matrix.Reports on Mathematical Logic 17 (1984), pp. 39–46.
A. Wroński.On finitely based consequence operations.Studia Logica 35 (1976), pp. 453–458.
A. Wroński.A three element matrix whose consequence operation is not finitely based.Bulletin of the Section of Logic, Polish Academy of Sciences 8 (1979), pp. 68–71.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pałasińska, K. Three-element nonfinitely axiomatizable matrices. Stud Logica 53, 361–372 (1994). https://doi.org/10.1007/BF01057933
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01057933