Congruences and Boolean filters of quasi-modular p-algebras
Journal Title: Discussiones Mathematicae - General Algebra and Applications - Year 2014, Vol 34, Issue 1
Abstract
The concept of Boolean filters in p-algebras is introduced. Some properties of Boolean filters are studied. It is proved that the class of all Boolean filters BF(L) of a quasi-modular p-algebra L is a bounded distributive lattice. The Glivenko congruence Φ on a p-algebra L is defined by (x, y) ∈ Φ iff x ∗∗ = y ∗∗. Boolean filters [Fa), a ∈ B(L), generated by the Glivenko congruence classes Fa (where Fa is the congruence class [a]Φ) are described in a quasi-modular p-algebra L. We observe that the set FB(L) = {[Fa) : a ∈ B(L)} is a Boolean algebra on its own. A one-one correspondence between the Boolean filters of a quasi-modular p-algebra L and the congruences in [Φ, ∇] is established. Also some properties of congruences induced by the Boolean filters [Fa), a ∈ B(L) are derived. Finally, we consider some properties of congruences with respect to the direct products of Boolean filters. Keywords: p-algebras, quasi-modular p-algebras, Boolean filters, direct products, congruences. 2010 Mathematics Subject Classification: 06A06, 06A20, 06A30, 06D15.
Authors and Affiliations
Abd El-Mohsen Badawy, Kar-Ping Shum
Keywords
Related Articles
- EP ID EP166208
- DOI -
- Views 23
- Downloads 0
VARIETIES OF REGULAR ALGEBRAS AND UNRANKED TREE LANGUAGES
In this paper we develop a variety theory for unranked tree languages and unranked algebras. In an unranked tree any symbol may label a node with any number of successors. Such trees appear in markup languages such as XM...
Congruences and Trajectories in Planar Semimodular Lattices
A 1955 result of J. Jakub´ık states that for the prime intervals p and q of a finite lattice, con(p) ≥ con(q) iff p is congruence-projective to q (via intervals of arbitrary size). The problem is how to determine whether...
POINTED PRINCIPALLY ORDERED REGULAR SEMIGROUPS
An ordered semigroup S is said to be principally ordered if, for every x ∈ S there exists x⋆ = max {y ∈ S | xyx 6 x}. Here we investigate those principally ordered regular semigroups that are pointed in the sense that th...
Trace inequalities for positive semidefinite matrices
Certain trace inequalities for positive definite matrices are generalized for positive semidefinite matrices using the notion of the group generalized inverse.
Idempotent Elements of Weak Projection Generalized Hypersubstitutions
A generalized hypersubstitution of type τ = (ni)i∈I is a mapping σ which maps every operation symbol fi to the term σ(fi) and may not preserve arity. It is the main tool to study strong hyperidentities that are used to c...