A join-completion of a poset is a completion for which each element is obtainable as a supremum, or join, of elements from the original poset. It is well known that the join-completions of a poset are in one-to-one correspondence with the closure systems on the lattice of up-sets of the poset. A Δ1-completion of a poset is a completion for which, simultaneously, each element is obtainable as a join of meets of elements of the original poset and as a meet of joins of elements from the original poset. We show that Δ1-completions are in one-to-one correspondence with certain triples consisting of a closure system of down-sets of the poset, a closure system of up-sets of the poset, and a binary relation between these two systems. Certain Δ1-com...
For a complete lattice L, in which every element is a join of completely join-irreducibles and a mee...
AbstractA familiar construction for a Boolean algebra A is its normal completion NA, given by its no...
In this paper we introduce an ecient algorithm for the on-line computation of the MacNeille completi...
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence an...
AbstractIn this paper, we introduce the concept of meet precontinuous posets, a generalization of me...
Summary. In the paper we present some auxiliary facts concerning posets and maps between them. Our m...
A b s t r a c t. The purpose of this note is to expose a new way of viewing the canonical extension ...
AbstractCanonical Completion of a poset is of central importance in obtaining fully abstract semanti...
In [2, 3] Moshier and Jipsen develop a topological duality for lattices and extend it to lattice exp...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
AbstractWe introduce a new type of dcpo-completion of posets, called D-completion. For any poset P, ...
We study computably enumerable equivalence relations (abbreviated as ceers) under computable reducib...
Several` “classical” results on algebraic complete lattices extend to algebraic posets and, more gen...
AbstractIf a poset lacks joins of directed subsets, one can pass to its ideal completion. But doing ...
For a complete lattice L, in which every element is a join of completely join-irreducibles and a mee...
AbstractA familiar construction for a Boolean algebra A is its normal completion NA, given by its no...
In this paper we introduce an ecient algorithm for the on-line computation of the MacNeille completi...
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence an...
AbstractIn this paper, we introduce the concept of meet precontinuous posets, a generalization of me...
Summary. In the paper we present some auxiliary facts concerning posets and maps between them. Our m...
A b s t r a c t. The purpose of this note is to expose a new way of viewing the canonical extension ...
AbstractCanonical Completion of a poset is of central importance in obtaining fully abstract semanti...
In [2, 3] Moshier and Jipsen develop a topological duality for lattices and extend it to lattice exp...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
AbstractWe introduce a new type of dcpo-completion of posets, called D-completion. For any poset P, ...
We study computably enumerable equivalence relations (abbreviated as ceers) under computable reducib...
Several` “classical” results on algebraic complete lattices extend to algebraic posets and, more gen...
AbstractIf a poset lacks joins of directed subsets, one can pass to its ideal completion. But doing ...
For a complete lattice L, in which every element is a join of completely join-irreducibles and a mee...
AbstractA familiar construction for a Boolean algebra A is its normal completion NA, given by its no...
In this paper we introduce an ecient algorithm for the on-line computation of the MacNeille completi...