Academia.eduAcademia.edu

Distributive Lattices

description27 papers
group0 followers
lightbulbAbout this topic
Distributive lattices are algebraic structures in which every pair of elements has a unique supremum (least upper bound) and infimum (greatest lower bound), satisfying the distributive property. Specifically, for any elements a, b, and c, the equation a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c) holds.
lightbulbAbout this topic
Distributive lattices are algebraic structures in which every pair of elements has a unique supremum (least upper bound) and infimum (greatest lower bound), satisfying the distributive property. Specifically, for any elements a, b, and c, the equation a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c) holds.
We study various generalizations and weakenings of the Rasiowa-Sikorski Lemma for Boolean algebras. Building on previous work from Goldblatt, we extend the Rasiowa-Sikorski Lemma to co-Heyting algebras and modal algebras, and show how... more
In this paper, we solve an open problem in an special case. The problem is to give a characterization for Heyting algebras by means of fractions. Here, we give a representation for a class of Heyting algebras by means of fractions.... more
Download research papers for free!