Displaying 41 – 60 of 414

Showing per page

Atomary tolerances on finite algebras

Bohdan Zelinka (1996)

Mathematica Bohemica

A tolerance on an algebra is defined similarly to a congruence, only the requirement of transitivity is omitted. The paper studies a special type of tolerance, namely atomary tolerances. They exist on every finite algebra.

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.

Balanced d-lattices are complemented

Martin Goldstern, Miroslav Ploščica (2002)

Discussiones Mathematicae - General Algebra and Applications

We characterize d-lattices as those bounded lattices in which every maximal filter/ideal is prime, and we show that a d-lattice is complemented iff it is balanced iff all prime filters/ideals are maximal.

Cardinalities of lattices of topologies of unars and some related topics

Anna Kartashova (2001)

Discussiones Mathematicae - General Algebra and Applications

In this paper we find cardinalities of lattices of topologies of uncountable unars and show that the lattice of topologies of a unar cannor be countably infinite. It is proved that under some finiteness conditions the lattice of topologies of a unar is finite. Furthermore, the relations between the lattice of topologies of an arbitrary unar and its congruence lattice are established.

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.

Clausal relations and C-clones

Edith Vargas (2010)

Discussiones Mathematicae - General Algebra and Applications

We introduce a special set of relations called clausal relations. We study a Galois connection Pol-CInv between the set of all finitary operations on a finite set D and the set of clausal relations, which is a restricted version of the Galois connection Pol-Inv. We define C-clones as the Galois closed sets of operations with respect to Pol-CInv and describe the lattice of all C-clones for the Boolean case D = {0,1}. Finally we prove certain results about C-clones over a larger set.

Clifford congruences on generalized quasi-orthodox GV-semigroups

Sunil K. Maity (2013)

Discussiones Mathematicae - General Algebra and Applications

A semigroup S is said to be completely π-regular if for any a ∈ S there exists a positive integer n such that aⁿ is completely regular. A completely π-regular semigroup S is said to be a GV-semigroup if all the regular elements of S are completely regular. The present paper is devoted to the study of generalized quasi-orthodox GV-semigroups and least Clifford congruences on them.

Currently displaying 41 – 60 of 414