2007/05/26 by Michel Krebs, Dominic van der Zypen, Krebs, Michel +1
Computer Science · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms
paper · pdf · doi:10.48550/arxiv.0705.3878
The ordering relation of a bounded distributive lattice L is a (distributive) (0, 1)-sublattice of L × L. This construction gives rise to a functor Φfrom the category of bounded distributive lattices to itself. We examine the interaction of Φwith Priestley duality and characterise those bounded distributive lattices L such that there is a bounded distributive lattice K such that Φ(K) is (isomorphic to) L.