Page 1

Displaying 1 – 10 of 10

Showing per page

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.

Boolean matrices ... neither Boolean nor matrices

Gabriele Ricci (2000)

Discussiones Mathematicae - General Algebra and Applications

Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we "show" that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A minor modification of this standard definition might fix it.

Currently displaying 1 – 10 of 10

Page 1