Related papers: Join-continuity + Hypercontinuity = Prime continui…
The canonical extension of a lattice is in an essential way a two-sided completion. Domain theory, on the contrary, is primarily concerned with one-sided completeness. In this paper, we show two things. Firstly, that the canonical extension…
In analogy to a result due to Drake and Thron about topological spaces, this paper studies the dcpos (directed complete posets) which are fully determined, among all dcpos, by their lattices of all Scott-closed subsets (such dcpos will be…
We construct a complete lattice $Z$ such that the binary supremum function $\sup:Z\times Z\to Z$ is discontinuous with respect to the product topology on $Z\times Z$ of the Scott topologies on each copy of $Z$. In addition, we show that…
We revisit the problem of Stone duality for lattices with various quasioperators, first studied in [14], presenting a fresh duality result. The new result is an improvement over that of [14] in two important respects. First, the…
We prove a number of dualities between posets and (pseudo)bases of open sets in locally compact Hausdorff spaces. In particular, we show that (1) Relatively compact basic sublattices are finitely axiomatizable. (2) Relatively compact basic…
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
We introduce a notion of strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the…
We prove two theorems which allow one to recognize indecomposable subcontinua of closed surfaces without boundary. If $X$ is a subcontinuum of a closed surface $S$, we call the components of $S \setminus X$ the complementary domains of $X$.…
For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…
We study a stable partial matching $\tau$ of the (possibly randomized) $d$-dimensional lattice with a stationary determinantal point process $\Psi$ on $\mathbb{R}^d$ with intensity $\alpha>1$. For instance, $\Psi$ might be a Poisson…
In this work, we discuss completeness for the lattice orders of first and second order stochastic dominance. The main results state that, both, first and second order stochastic dominance induce Dedekind super complete lattices,…
The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T)…
Two kinds of the connective implication are introduced as term operations of a pseudocomplemented lattice. It is shown that they share a lot of properties with the intuitionistic implication based on Heyting algebras. In particular, if the…
This paper studies the weak one-step closure and one-step closure properties concerning the structure of Scott closures. We deduce that every quasicontinuous domain has weak one-step closure and show that a quasicontinuous poset need not…
We give two sufficient conditions for the lattice Co(R^n,X) of relatively convex sets of n-dimensional real space R^n to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice…
A join-semilattice $L$ is said to be conjunctive if it has a top element $1$ and it satisfies the following first-order condition: for any two distinct $a,b\in L$, there is $c\in L$ such that either $a\vee c\not=1=b\vee c$ or $a\vee…
Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…