Vol. 76, No. 2, 1978

Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
Uniform representations of congruence schemes

Joel David Berman and George Grätzer

Vol. 76 (1978), No. 2, 301–311
Abstract

A congruence scheme Σ is a finite sequence of polynomials. A nontrivial equational class K is a representation of Σ iff the principal congruences in K can be described in a natural fashion by Σ. In this paper it is shown that a necessary and sufficient condition for a congruence scheme Σ whose polynomials do not contain constants to have a representation is that each polynomial in the sequence be at least binary.

Mathematical Subject Classification
Primary: 08A25, 08A25
Milestones
Received: 21 December 1976
Revised: 10 September 1977
Published: 1 June 1978
Authors
Joel David Berman
George Grätzer