Representations of stably continuous semi-lattices by information systems and abstract bases
From MaRDI portal
Publication:2224847
DOI10.1016/j.ipl.2020.106036zbMath1506.68052OpenAlexW3092297413MaRDI QIDQ2224847
Publication date: 4 February 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2020.106036
Knowledge representation (68T30) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)
Related Items
Information systems for continuous semi-lattices, A set-theoretic representation of algebraic L-domains, The categorical equivalence between domains and interpolative generalized closure spaces, Bounded complete domains and their logical form
Cites Work
- Re-visiting axioms of information systems
- Representations of algebraic domains and algebraic L-domains by information systems
- A representation of L-domains by information systems
- Information systems revisited -- the general continuous case
- Effectively given domains
- Continuous information systems
- A representation of SFP
- Information systems for continuous posets
- Some categorical aspects of information systems and domains
- When do abstract bases generate continuous lattices and L-domains
- Continuous Lattices and Domains
- Non-Hausdorff Topology and Domain Theory
- Category Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item