Closures on CPOs form complete lattices

DOI10.1006/inco.1999.2801zbMath1004.06007OpenAlexW2058938808MaRDI QIDQ1854300

Francesco Ranzato

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cc49274ad05f855a286f7d1f9eeaa1d7029a798c

zbMATH Keywords

closure operatorscomplete partial order

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (2)

Universal extensions of specialization semilattices ⋮ The categorical equivalence between domains and interpolative generalized closure spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lattice of closure relations on a poset
• Closure functions and general iterates as reflectors
• Weak relative pseudo-complements of closure operators
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Properly injective spaces and function spaces
• Constraint logic programming with dynamic scheduling: A semantics based on closure operators
• Optimal domains for disjunctive abstract interpretation
• On locales of localizations
• The closure operators of a lattice
• A Powerdomain Construction

This page was built for publication: Closures on CPOs form complete lattices