Bounded complete domains and their logical form

DOI10.1016/j.ic.2022.104958OpenAlexW4296200498MaRDI QIDQ2105444

Longchun Wang, Qing-Guo Li

Publication date: 8 December 2022

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

Full work available at URL: https://doi.org/10.1016/j.ic.2022.104958

zbMATH Keywords

domain theorydomain equationsapproximable FD-algebrasbounded complete domainsstable open sets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Topological representations of Lawson compact algebraic L-domains and Scott domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Re-visiting axioms of information systems
• Formal query systems on contexts and a representation of algebraic lattices
• Using information systems to solve recursive domain equations
• Generalised information systems capture L-domains
• A logical approach to stable domains
• Information systems revisited -- the general continuous case
• Domain theory in logical form
• Weak algebraic information systems and a new equivalent category of DOM of domains
• Toward an infinitary logic of domains: Abramsky logic for transition systems
• Clausal logic and logic programming in algebraic domains
• A logic for Lawson compact algebraic L-domains
• A categorical characterization of the least \(Q\)-quantale completion of \(Q\)-ordered semigroups
• Continuous L-domains in logical form
• Representations of stably continuous semi-lattices by information systems and abstract bases
• Closure spaces and completions of posets
• Spaces of maximal points
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
• Continuous Lattices and Domains
• Non-Hausdorff Topology and Domain Theory
• Continuous Domain Theory in Logical Form
• Continuous Domains in Formal Concept Analysis*
• Disjunctive systems and L-Domains

This page was built for publication: Bounded complete domains and their logical form