We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean al...
For a Heyting algebra A, we show that the following conditions are equivalent: (i) A is profinite; (ii) A is finitely approximable, complete, and completely join-prime generated; (...
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
A zircon is a poset in which every principal order ideal is finite and equipped with a so-called special matching. We prove that the subposet induced by the fixed points of any aut...