BOOLEAN FILTERS IN PSEUDO-COMPLEMENTED ALMOST DISTRIBUTIVE LATTICES
Journal Title: Discussiones Mathematicae - General Algebra and Applications - Year 2015, Vol 35, Issue 2
Abstract
In this paper we have introduced the concept of Boolean filters in a pseudo-complemented Almost Distributive Lattice (pseudo-complemented ADL) and studied their properties. Finally, a Boolean filter is characterized in terms of filter congruences.
Authors and Affiliations
N. Rafi, Ravi Kumar Bandaru, G. C. Rao
Keywords
Related Articles
- EP ID EP304468
- DOI -
- Views 42
- Downloads 0
ZERO-DIVISOR GRAPHS OF REDUCED RICKART ∗-RINGS
For a ring A with an involution ∗, the zero-divisor graph of A, Γ∗ (A), is the graph whose vertices are the nonzero left zero-divisors in A such that distinct vertices x and y are adjacent if and only if xy∗ = 0. In this...
Intervals of certain classes of Z-matrices
Let A and B be M-matrices satisfying A ≤ B and J = [A, B] be the set of all matrices C such that A ≤ C ≤ B, where the order is component wise. It is rather well known that if A is an M-matrix and B is an invertible Mmatr...
HOLOMORPH OF GENERALIZED BOL LOOPS II
The notion of the holomorph of a generalized Bol loop (GBL) is characterized afresh. The holomorph of a right inverse property loop (RIPL) is shown to be a GBL if and only if the loop is a GBL and some bijections of the...
RIGHT DERIVATION OF ORDERED Γ-SEMIRINGS
In this paper, we introduce the concept of a right derivation of ordered Γ-semirings, we study some of the properties of right derivations of ordered Γ-semirings and we prove that if d is a non-zero right derivation of a...
ON THE UNRECOGNIZABILITY BY PRIME GRAPH FOR THE ALMOST SIMPLE GROUP PGL(2, 9)
The prime graph of a finite group G is denoted by Γ(G). Also G is called recognizable by prime graph if and only if each finite group H with Γ(H) = Γ(G), is isomorphic to G. In this paper, we classify all finite groups w...