Abstract
A family of logical systems, which may be regarded as extending equational logic, is studied. The equationsf=g of equational logic are generalized to congruence equivalence formulasf≡g (modx), wheref andg are terms interpreted as elements of an algebraV of some specified type. and termx is interpreted as a member of ann-permutable lattice of congruences forV. Formal concepts of proof and derivability from systems of hypotheses are developed. These proofs, like those of equational logic. require only finite algebraic processes, without manipulation of logical quantifiers or connectives. The logical systems are shown to be correct and complete: a well-formed statement is derivable from a system of hypotheses if and only if it is valid in all models of these hypotheses.
Similar content being viewed by others
References
G. Birkhoff,On the structure of abstract algebras, Proc. Cambridge Phil. Soc.31 (1935), 433–454.
G. Birkhoff,Lattice Theory. Third ed., Amer. Math. Soc. Colloquium Publications XXV, Providence, R. I., 1967.
G. Grätzer,Universal Algebra. Second ed., Springer Verlag, Berlin, Heidelberg and New York, 1978, or First ed., Van Nostrand, Princeton, N. J., 1968.
G. Hutchinson,On the representation of lattices by modules. Trans. Amer. Math. Soc. 209 (1975), 311–351.
B. Jónsson,On the representation of lattices, Math. Scand.1 (1953), 193–206.
A. Mal'cev,On the general theory of algebraic systems (Russian), Mat. Sb. (N.S.)35 (77) (1954), 3–20.
J. B. Rosser,Logic for Mathematicians. McGraw-Hill, New York, 1953.
R. Wille,Kongruenzklassengeometrien. Springer-Verlag Lecture Notes in Mathematics No. 113, Berlin, Heidelberg and New York, 1970.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hutchinson, G. A complete logic forn-permutable congruence lattices. Algebra Universalis 13, 206–224 (1981). https://doi.org/10.1007/BF02483835
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02483835