Algebraic duality of constant algebras
We present an algorithm for constructing the free algebra over a given finite partial algebra in the variety determined by a finite list of equations. The algorithm succeeds whenever the desired free algebra is finite.
Let V be a variety with two distinct nullary operations 0 and 1. An algebra 𝔄 ∈ V is called balanced if for each Φ,Ψ ∈ Con(𝔄), we have [0]Φ = [0]Ψ if and only if [1]Φ = [1]Ψ. The variety V is called balanced if every 𝔄 ∈ V is balanced. In this paper, balanced varieties are characterized by a Mal'cev condition (Theorem 3). Furthermore, some special results are given for varieties of bounded lattices.
An algebra is tolerance trivial if where is the lattice of all tolerances on . If contains a Mal’cev function compatible with each , then is tolerance trivial. We investigate finite algebras satisfying also the converse statement.