### The congruence lattice of implication algebras.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Back to Simple Search
# Advanced Search

We characterize lattices with a complemented tolerance lattice. As an application of our results we give a characterization of bounded weakly atomic modular lattices with a Boolean tolerance lattice.

Using congruence schemes we formulate new characterizations of congruence distributive, arithmetical and majority algebras. We prove new properties of the tolerance lattice and of the lattice of compatible reflexive relations of a majority algebra and generalize earlier results of H.-J. Bandelt, G. Cz'{e}dli and the present authors. Algebras whose congruence lattices satisfy certain 0-conditions are also studied.

Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality and restrictions of the distance to finite chains may or may not coincide with the natural, difference-of-height distance measured in a chain. It is shown that for semilattices the semimodularity ensures the good behaviour of the distances considered. The Jordan-Dedekind chain condition, which is weaker than semimodularity, is equivalent to the...

**Page 1**