Weak algebraic information systems and a new equivalent category of DOM of domains

DOI10.1016/j.tcs.2019.01.042zbMath1411.68055OpenAlexW2914479487MaRDI QIDQ1727992

Luoshan Xu, Qingyu He

Publication date: 21 February 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.01.042

zbMATH Keywords

retractcategorical equivalencedomaininformation structureapproximable mappingsection-retraction pairweak algebraic information system

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)

Related Items (3)

Information systems for continuous semi-lattices ⋮ Bounded complete domains and their logical form ⋮ A representation of continuous lattices based on closure spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Formal topological characterizations of various continuous domains
• \(dI\)--domains as prime information systems
• Continuous information systems
• A representation of SFP
• Information systems for continuous posets
• Continuous Lattices and Domains
• Non-Hausdorff Topology and Domain Theory
• Various Constructions of Continuous Information Systems

This page was built for publication: Weak algebraic information systems and a new equivalent category of DOM of domains