- A term
or
of type
is a formal expression as a string of symbols, defined recursively as
follows, starting from variable symbols
for
:
(a) Each
is a term, and
(b) if
are terms, so is
f
, where
f
and the commas and parentheses are symbols and
.
A term
in variable symbols
is
often described by
. For
algebras with familiar notations we use those notations instead;
for example, a group term might be written as
.
- For elements
of an algebra
and term
, the value
is the element of
obtained by using the operations
of
while following
as a recipe.
Thus
induces a function on
. The
functions so induced are called the n-ary term functions on
. (For polynomial functions, see below.)
- A term relation
is an equation holding for a particular
-tuple
of elements of
.
- A law is a formal equation
or
, with
understood. Many authors write
to distinguish
such formal laws from equations involving elements.
The law
holds in
when all
-tuples
from
satisfy the
term relation
.
We also say
satisfies
, or
is a model of
, or write
.
- A variety of algebras of a given type is the class of all
models of some set of laws. Examples are the varieties of all groups,
of all abelian groups, of all lattices, of all distributive lattices,
and of other kinds of algebras whose laws are given in §
.
If
is an algebra we write
Var
for the variety determined
by all laws holding in
, which is the smallest variety containing
.
- A polynomial or polynomial function on
is a term
function in which some entries may be held constant. For example,
if
R as a ring,
is a term function while
is not a term function but is a polynomial function,
obtained from the term function
by
.