Related papers: Closure operators on dcpos
Motivated by the Hofmann--Lawson theorem, which states that every continuous lattice is inf-generated by its irreducible elements, we explore how to represent posets by extreme points with respect to a closure operator. For this purpose, we…
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…
For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…
One of the main prerequisites for understanding sheaves on elementary toposes is the proof that a (Lawvere-Tierney) topology on a topos induces a closure operator on it, and vice-versa. That standard theorem is usually presented in a…
A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…
In this paper, we tailor-make new approximation operators inspired by rough set theory and specially suited for domain theory. Our approximation operators offer a fresh perspective to existing concepts and results in domain theory, but also…
Given a poset $P$ and a standard closure operator $\Gamma:\wp(P)\to\wp(P)$ we give a necessary and sufficient condition for the lattice of $\Gamma$-closed sets of $\wp(P)$ to be a frame in terms of the recursive construction of the…
We present a survey of the two-dimensional and tensorial structure of the lifting doctrine in constructive domain theory, i.e. in the theory of directed-complete partial orders (dcpos) over an arbitrary elementary topos. We establish the…
Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of the present paper in order to establish a useful tool for studying the logic of quantum mechanics. They investigated structural…
It is well-known that in the logic of quantum mechanics disjunctions and conjunctions can be represented by joins and meets, respectively, in an orthomodular lattice provided their entries commute. This was the reason why J. Pykacz…
In this paper, we present some fixed point theorems for operator systems in the line of Krasnosel'skii's theorem in cones. The cone-compression and cone-expansion type conditions are imposed in a component-wise manner. Unlike related…
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)…
In this paper, we study some properties of the closure operator in the Mac\'ias topology on infinite integral domains. Moreover, under certain conditions, we present topological proofs of the infiniteness of maximal ideals and…
Convex geometry is a closure space $(G,\phi)$ with the anti-exchange property. A classical result of Edelman and Jamison (1985) claims that every finite convex geometry is a join of several linear sub-geometries, and the smallest number of…
We introduce a canonical operator-theoretic construction associated to a finite geometric lattice, in which a simple nonassociative ``diamond product'' on the lattice basis gives rise to a family of creation operators indexed by atoms and a…
In this paper, we study the properties of closure operators obtained as initial lifts along a reflector, and compactness with respect to them in particular. Applications in the areas of topology, topological groups and topological…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have…
Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…
The Sasaki projection and its dual were introduced as a mapping from the lattice of closed subspaces of a Hilbert space onto one of its segments. In a previous paper the authors showed that the Sasaki operations induced by the Sasaki…