Let S be a distributive {∨, 0 }-semilattice. In a previous paper, the second author proved the following result: Suppose that S is a lattice. Let K be a lattice, let φ : Conc K → S be a {∨, 0 }-homomorphism. Then φ is, up to isomorphism, of the form Conc f , for a lattice L and a lattice homomorphism f : K → L. In the statement above, Conc K denotes as usual the {∨, 0 }-semilattice of all finit...

For P a poset or lattice, let Id(P ) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P ) = Id(P )−{∅}. This note obtains various results to the effect that Id(P ) is always, and id(P ) often, “essentially larger” than P. In the first vein, we find that a poset P admits no <-respecting map (and so in particular, no one-to-one isotone...

The first paper published on Abstract Stone Duality showed that the overt discrete objects (those admitting ∃ and = internally) form a pretopos, i.e. a category with finite limits, stable disjoint coproducts and stable effective quotients of equivalence relations. Using an N-indexed least fixed point axiom, here we show that this full subcategory is an arithmetic universe, having a free semilat...

The Abelian Sandpile Model is a diffusion process on (directed) graphs, studied, under various names, in statistical physics, discrete dynamical systems, theoretical computer science, algebraic graph theory, and other fields. The model takes a directed multigraph X with a sink accessible from all nodes; associates a configuration space with X and defines transition rules between the configurati...

We study feebly compact shift-continuous topologies on the semilattice (expn λ;∩). It is shown that a T1-topology of this kind sequentially pracompact if and only it (ω)-compact.

The Alexander dual of an arbitrary meet-semilattice is described explicitly. Meet-distributive meet-semilattices whose Alexander dual is level are characterized.