Abstract
We show (1) the consequence determined by a variety V of algebraic semigroup matrices is finitely based iffV is finitely based, (2) the consequence determined by all 2-valued semigroup connectives, Λ, ∨, ↔, +, in other words the collection of common rules for all these connectives, is finitely based. For possible applications see Sect. 0.
Similar content being viewed by others
References
Czelakowski, J.: Equivalential logics. II. Stud. Logica40, 355–372 (1981)
Graczyńska, E.: On regular identities. Algebra Univers.17, 369–375 (1983)
Grätzer, G., Lakser, H., Plonka, J.: Joins and direct products of equational classes. Can Math. Bull.12, 741–744 (1969)
Łos, J., Suszko, R.: Remarks on sentential logics. Ind. Math.20, 177–183 (1958)
Perkins, P.: Bases for equational theories of semigroups. J. Algebra11, 298–314 (1969)
Rasiowa, H.: On a certain fragment of the implicational sentential calculus. Stud. Logica3, 208–226 (1955)
Rautenberg, W.: 2-Element matrices. Stud. Logica40, 315–353 (1981)
Rautenberg, W.: Consequence relation of 2-element algebras. In: Foundations of Logic and Linguistics: New York, 1985
Rautenberg, W.: Common properties of Λ and ∨. To appear Stud. Logica48 (1989)
Wójcicki, R.: Theory of logical calculi. Dordrecht, 1988
Wrónski, A.: A 3-valued matrix whose consequence is not finitely based. Bull. Sect. Logic Pol. Acad. Sci.8, 68–71 (1979)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rautenberg, W. Axiomatization of semigroup consequences. Arch Math Logic 29, 111–123 (1989). https://doi.org/10.1007/BF01620620
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01620620