2010/06/19 by Xinmin Lu, Lu, Xinmin, Dongsheng Liu +5
Computer Science · Decision Sciences · #Advanced Algebra and Logic #FOS: Mathematics #Fuzzy and Soft Set Theory #Group Theory (math.GR) #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.1006.3853
openalex publication_date 2010/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A distributive lattice L with minimum element 0 is called decomposable if a and b are not comparable elements in L then there exist a,b∈ L such that a=a\vee(a\wedge b), b=b\vee(a\wedge b) and a\wedge b=0. The main purpose of this paper is to study the structure of decomposable lattices determined by their prime ideals. The properties for five special decomposable lattices are derived.