Displaying 21 – 40 of 229

Showing per page

An algorithm for free algebras

Jaroslav Ježek (2010)

Commentationes Mathematicae Universitatis Carolinae

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.

Balanced congruences

Ivan Chajda, Günther Eigenthaler (2001)

Discussiones Mathematicae - General Algebra and Applications

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.

Characterizing tolerance trivial finite algebras

Ivan Chajda (1994)

Archivum Mathematicum

An algebra A is tolerance trivial if A ̰ = A where A ̰ is the lattice of all tolerances on A . If A contains a Mal’cev function compatible with each T A ̰ , then A is tolerance trivial. We investigate finite algebras satisfying also the converse statement.

Currently displaying 21 – 40 of 229