Degrees of join-distributivity via Bruns-Lakser towers
G. Bezhanishvili, F. Dashiell Jr, M.A. Moshier, J. Walters-Wayland

TL;DR
This paper introduces a hierarchy of degrees of join-distributivity in bounded distributive lattices using Bruns-Lakser towers and Priestley duality, generalizing Esakia's representation of Heyting lattices.
Contribution
It develops a new hierarchy of join-distributivity degrees via Bruns-Lakser towers and extends duality-based characterizations to proHeyting lattices.
Findings
Established hierarchies measuring $6$-degrees of distributivity.
Provided dual characterizations using Priestley duality.
Generalized Esakia's representation to proHeyting lattices.
Abstract
We utilize the Bruns-Lakser completion to introduce Bruns-Lakser towers of a meet-semilattice. This machinery enables us to develop various hierarchies inside the class of bounded distributive lattices, which measure -degrees of distributivity of bounded distributive lattices and their Dedekind-MacNeille completions. We also use Priestley duality to obtain a dual characterization of the resulting hierarchies. Among other things, this yields a natural generalization of Esakia's representation of Heyting lattices to proHeyting lattices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Algebra and Logic · Advanced Topology and Set Theory
