Boolean Filters of Distributive Lattices

2013 ◽  
Vol 3 (3) ◽  
pp. 41 ◽  
Author(s):  
Mukkamala Sambasiva Rao ◽  
K. P. Shum
Keyword(s):  
Distributive Lattices ◽  
Boolean Filters

L-Fuzzy Filters of Almost Distributive Lattices

2018 ◽  
Vol 8 (1) ◽  
pp. 35
Author(s):  
U. M. Swamy ◽  
Ch. Santhi Sundar Raj ◽  
A. Natnael Teshale
Keyword(s):  
Distributive Lattices ◽  
Fuzzy Filters

scholarly journals Priestley duality for MV-algebras and beyond

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Wesley Fussner ◽  
Mai Gehrke ◽  
Samuel J. van Gool ◽  
Vincenzo Marra
Keyword(s):  
Large Class ◽  
Order Conditions ◽  
Enriched Environment ◽  
Priestley Duality ◽  
Distributive Lattices ◽  
First Order ◽  
Dual Spaces ◽  
Binary Operations ◽  
New Perspective ◽  
Mv Algebras

Abstract We provide a new perspective on extended Priestley duality for a large class of distributive lattices equipped with binary double quasioperators. Under this approach, non-lattice binary operations are each presented as a pair of partial binary operations on dual spaces. In this enriched environment, equational conditions on the algebraic side of the duality may more often be rendered as first-order conditions on dual spaces. In particular, we specialize our general results to the variety of MV-algebras, obtaining a duality for these in which the equations axiomatizing MV-algebras are dualized as first-order conditions.

scholarly journals The Central Decomposition of FD01(n)

Order ◽  
2021 ◽  
Author(s):  
Peter Köhler
Keyword(s):  
Distributive Lattices ◽  
Finitely Generated ◽  
Finite Distributive Lattices

AbstractThe paper presents a method of composing finite distributive lattices from smaller pieces and applies this to construct the finitely generated free distributive lattices from appropriate Boolean parts.

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 A New Extended Soft Intersection Set toM,N-SIImplicative Fitters ofBL-Algebras

2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Jianming Zhan ◽  
Qi Liu ◽  
Hee Sik Kim
Keyword(s):  
Set Theory ◽  
Soft Set ◽  
Mathematical Framework ◽  
Boolean Filters

Molodtsov’s soft set theory provides a general mathematical framework for dealing with uncertainty. The concepts of(M,N)-SIimplicative (Boolean) filters ofBL-algebras are introduced. Some good examples are explored. The relationships between(M,N)-SIfilters and(M,N)-SIimplicative filters are discussed. Some properties of(M,N)-SIimplicative (Boolean) filters are investigated. In particular, we show that(M,N)-SIimplicative filters and(M,N)-SIBoolean filters are equivalent.

Sign in / Sign up

Export Citation Format

Share Document