scholarly journals Almost distributive lattices

1981 ◽  
Vol 31 (1) ◽  
pp. 77-91 ◽  
Author(s):  
U. Maddana Swamy ◽  
G. C. Rao
Keyword(s):  
Distributive Lattice ◽  
Distributive Lattices ◽  
Boolean Ring ◽  
Triple Systems ◽  
Boolean Rings ◽  
Principal Ideals ◽  
Sheaf Representations ◽  
One To One ◽  
Almost All ◽  
Regular Rings

AbstractThe concept of ‘Almost Distributive Lattices’ (ADL) is introduced. This class of ADLs includes almost all the existing ring theoretic generalisations of a Boolean ring (algebra) like regular rings, P-rings, biregular rings, associate rings, P1-rings, triple systems, etc. This class also includes the class of Baer-Stone semigroups. A one-to-one correspondence is exhibited between the class of relatively complemented ADLs and the class of Almost Boolean Rings analogous to the well-known Stone's correspondence. Many concepts in distributive lattices can be extended to the class of ADLs through its principal ideals which from a distributive lattice with 0. Subdirect and Sheaf representations of an ADL are obtained.

PSEUDO-COMPLEMENTATION ON GENERALIZED ALMOST DISTRIBUTIVE LATTICES

2010 ◽  
Vol 03 (02) ◽  
pp. 335-346
Author(s):  
G. C. Rao ◽  
Ravi Kumar Bandaru ◽  
N. Rafi
Keyword(s):  
Distributive Lattice ◽  
Left Identity ◽  
Distributive Lattices ◽  
One To One ◽  
Identity Elements

The concept of a pseudo-complementation on a Generalized Almost Distributive Lattice (GADL) with 0 is introduced and proved that there is a one-to-one correspondence between the pseudo-complementations on a GADL L with 0 and left identity elements of L. The concept of *–GADL, disjunctive GADL is also introduced. We characterized *–GADL in terms of disjunctive GADL.

scholarly journals μ -Fuzzy Filters in Distributive Lattices

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Wondwosen Zemene Norahun
Keyword(s):  
Distributive Lattice ◽  
Special Class ◽  
Distributive Lattices ◽  
Fuzzy Filter ◽  
One To One ◽  
Fuzzy Filters

In this paper, we introduce the concept of μ -fuzzy filters in distributive lattices. We study the special class of fuzzy filters called μ -fuzzy filters, which is isomorphic to the set of all fuzzy ideals of the lattice of coannihilators. We observe that every μ -fuzzy filter is the intersection of all prime μ -fuzzy filters containing it. We also topologize the set of all prime μ -fuzzy filters of a distributive lattice. Properties of the space are also studied. We show that there is a one-to-one correspondence between the class of μ -fuzzy filters and the lattice of all open sets in X μ . It is proved that the space X μ is a T 0 space.

Orthocomplemented difference lattices in association with generalized rings

2012 ◽  
Vol 62 (6) ◽  
Author(s):  
Milan Matoušek ◽  
Pavel Pták
Keyword(s):  
Symmetric Difference ◽  
Natural Question ◽  
Boolean Ring ◽  
Quantum Logics ◽  
Universal Algebras ◽  
Boolean Rings ◽  
Additional Operation ◽  
One To One

AbstractOrthocomplemented difference lattices (ODLs) are orthocomplemented lattices endowed with an additional operation of “abstract symmetric difference”. In studying ODLs as universal algebras or instances of quantum logics, several results have been obtained (see the references at the end of this paper where the explicite link with orthomodularity is discussed, too). Since the ODLs are “nearly Boolean”, a natural question arises whether there are “nearly Boolean rings” associated with ODLs. In this paper we find such an association — we introduce some difference ring-like algebras (the DRAs) that allow for a natural one-to-one correspondence with the ODLs. The DRAs are defined by only a few rather plausible axioms. The axioms guarantee, among others, that a DRA is a group and that the association with ODLs agrees, for the subrings of DRAs, with the famous Stone (Boolean ring) correspondence.

L-ALMOST DISTRIBUTIVE LATTICES

2011 ◽  
Vol 04 (01) ◽  
pp. 171-178 ◽  
Author(s):  
G. C. Rao ◽  
Berhanu Assaye ◽  
R. Prasad
Keyword(s):  
Distributive Lattice ◽  
Distributive Lattices ◽  
Principal Ideals ◽  
Equivalent Conditions

In this paper, we introduce the concept of an L-Almost Distributive Lattice (L-ADL) as a generalization of an L-algebra in the class of ADLs. We characterize an L-ADL in terms of the set of all its principal ideals. We also give a number of equivalent conditions for an L-ADL to become an L-algebra.

Congruence relations on almost distributive lattices-II

2019 ◽  
pp. 2150005
Author(s):  
Gezahagne Mulat Addis
Keyword(s):  
Distributive Lattice ◽  
Congruence Relation ◽  
Congruence Class ◽  
Distributive Lattices ◽  
Ideal Formula ◽  
Congruence Relations

For a given ideal [Formula: see text] of an almost distributive lattice [Formula: see text], we study the smallest and the largest congruence relation on [Formula: see text] having [Formula: see text] as a congruence class.

scholarly journals When do L-fuzzy ideals of a ring generate a distributive lattice?

2016 ◽  
Vol 14 (1) ◽  
pp. 531-542
Author(s):  
Ninghua Gao ◽  
Qingguo Li ◽  
Zhaowen Li
Keyword(s):  
Distributive Lattice ◽  
Heyting Algebra ◽  
Lattice Structures ◽  
Boolean Ring ◽  
Fuzzy Subset ◽  
The Family ◽  
Essential Properties ◽  
Fuzzy Ideal

AbstractThe notion of L-fuzzy extended ideals is introduced in a Boolean ring, and their essential properties are investigated. We also build the relation between an L-fuzzy ideal and the class of its L-fuzzy extended ideals. By defining an operator “⇝” between two arbitrary L-fuzzy ideals in terms of L-fuzzy extended ideals, the result that “the family of all L-fuzzy ideals in a Boolean ring is a complete Heyting algebra” is immediately obtained. Furthermore, the lattice structures of L-fuzzy extended ideals of an L-fuzzy ideal, L-fuzzy extended ideals relative to an L-fuzzy subset, L-fuzzy stable ideals relative to an L-fuzzy subset and their connections are studied in this paper.

scholarly journals Weak LI-ideals in implicative almost distributive lattices

2021 ◽  
Vol 14 (3) ◽  
pp. 207-217
Author(s):  
Tilahun Mekonnen Munie
Keyword(s):  
Distributive Lattice ◽  
Research Area ◽  
Distributive Lattices ◽  
Lattice Implication Algebra ◽  
Implication Algebra ◽  
New Development

In the field of many valued logic, lattice valued logic (especially ideals) plays an important role. Nowadays, lattice valued logic is becoming a research area. Researchers introduced weak LI-ideals of lattice implication algebra. Furthermore, other scholars researched LI-ideals of implicative almost distributive lattice. Therefore, the target of this paper was to investigate new development on the extension of LI-ideal theories and properties in implicative almost distributive lattice. So, in this paper, the notion of weak LI-ideals and maximal weak LI- ideals of implicative almost distributive lattice are defined. The properties of weak LI- ideals in implicative almost distributive lattice are studied and several characterizations of weak LI-ideals are given. Relationship between weak LI-ideals and weak filters are explored. Hence, the extension properties of weak LI-ideal of lattice implication algebra to that of weak LI-ideal of implicative almost distributive lattice were shown.

On the Partially Ordered Set of Prime Ideals of a Distributive Lattice

1971 ◽  
Vol 23 (5) ◽  
pp. 866-874 ◽  
Author(s):  
Raymond Balbes
Keyword(s):  
Distributive Lattice ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Complete Characterization ◽  
Distributive Lattices ◽  
Prime Ideals ◽  
Partially Ordered ◽  
Irreducible Elements

For a distributive lattice L, let denote the poset of all prime ideals of L together with ∅ and L. This paper is concerned with the following type of problem. Given a class of distributive lattices, characterize all posets P for which for some . Such a poset P will be called representable over. For example, if is the class of all relatively complemented distributive lattices, then P is representable over if and only if P is a totally unordered poset with 0, 1 adjoined. One of our main results is a complete characterization of those posets P which are representable over the class of distributive lattices which are generated by their meet irreducible elements. The problem of determining which posets P are representable over the class of all distributive lattices appears to be very difficult.

Factor-Correspondences in Regular Rings

1982 ◽  
Vol 34 (1) ◽  
pp. 23-30
Author(s):  
S. K. Berberian
Keyword(s):  
Present Article ◽  
Regular Ring ◽  
Decomposition Theorem ◽  
Matrix Rings ◽  
Basic Properties ◽  
Principal Ideals ◽  
Highly Effective ◽  
Left Factor ◽  
Regular Rings

Factor-correspondences are nothing more than a way of describing isomorphisms between principal ideals in a regular ring. However, due to a remarkable decomposition theorem of M. J. Wonenburger [7, Lemma 1], they have proved to be a highly effective tool in the study of completeness properties in matrix rings over regular rings [7, Theorem 1]. Factor-correspondences also figure in the proof of D. Handelman's theorem that an ℵ0-continuous regular ring is unitregular [4, Theorem 3.2].The aim of the present article is to sharpen the main result in [7] and to re-examine its applications to matrix rings. The basic properties of factor-correspondences are reviewed briefly for the reader's convenience.Throughout, R denotes a regular ring (with unity).Definition 1 (cf. [5, p. 209ff], [7, p. 212]). A right factor-correspondence in R is a right R-isomorphism φ : J → K, where J and K are principal right ideals of R (left factor-correspondences are defined dually).

scholarly journals Finitely generated pseudocomplemented distributive lattices

1975 ◽  
Vol 19 (2) ◽  
pp. 238-246 ◽  
Author(s):  
J. Berman ◽  
ph. Dwinger
Keyword(s):  
Distributive Lattice ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Distributive Lattices ◽  
Basic Fact ◽  
Finitely Generated ◽  
Partially Ordered ◽  
Finite Set ◽  
Natural Way

If L is a pseudocomplemented distributive lattice which is generated by a finite set X, then we will show that there exists a subset G of L which is associated with X in a natural way that ¦G¦ ≦ ¦X¦ + 2¦x¦ and whose structure as a partially ordered set characterizes the structure of L to a great extent. We first prove in Section 2 as a basic fact that each element of L can be obtained by forming sums (joins) and products (meets) of elements of G only. Thus, L considered as a distributive lattice with 0,1 (the operation of pseudocomplementation deleted), is generated by G. We apply this to characterize for example, the maximal homomorphic images of L in each of the equational subclasses of the class Bω of pseudocomplemented distributive lattices, and also to find the conditions which have to be satisfied by G in order that X freely generates L.

Sign in / Sign up

Export Citation Format

Share Document