Generalised information systems capture L-domains
From MaRDI portal
Abstract: A generalisation of Scott's information systems cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for each atomic proposition (token) saying which finite sets of such statements express information that is consistent with the given statement. It is shown that the states of such generalised information systems form an L-domain, and that each L-domain can be generated in this way, up to isomorphism. Moreover, the equivalence of the category of generalised information systems with the category of L-domains is derived. In addition, it will be seen that from every generalised information system capturing an algebraic bounded-complete domain a corresponding Scott information system can be obtained in an easy and natural way, and vice versa; similarly for Hoofman's continuous information systems cite{ho93} and the continuous bounded-complete domains captured by them; for Chen and Jung's disjunctive propositional logic cite{cj06} and algebraic L-domains (as well as for Wang and Li's cite{wll20} finitary version and Lawson-compact algebraic L-domains); and for Wang and Li's conjunctive sequent calculi cite{wlbc20} and proper continuous bounded-complete domains. The proofs always contain syntactic translations between the logical calculi involved.
Recommendations
Cites work
- A logic for Lawson compact algebraic L-domains
- A logical approach to stable domains
- A representation of L-domains by information systems
- A representation of proper BC domains based on conjunctive sequent calculi
- Categories of embeddings
- Continuous information systems
- Continuous Lattices and Domains
- Disjunctive systems and L-Domains
- Domain theory in logical form
- scientific article; zbMATH DE number 3858394 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 48416 (Why is no real title available?)
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 107999 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 1142322 (Why is no real title available?)
- scientific article; zbMATH DE number 783754 (Why is no real title available?)
- Information systems revisited -- the general continuous case
- Information Systems with Witnesses: The Function Space Construction
- Re-visiting axioms of information systems
- Representing L-domains as information systems
Cited in
(12)- Bounded complete domains and their logical form
- Information systems for continuous semi-lattices
- The categorical equivalence between domains and interpolative generalized closure spaces
- Representing L-domains as information systems
- A set-theoretic representation of algebraic L-domains
- A note on information systems for continuous semi-lattices
- A set-theoretic approach to algebraic \(\mathrm{L}\)-domains
- Domains, information frames, and their logic
- A representation of Lawson compact L-domains by information systems
- sL-approximation spaces capture sL-domains
- Domains, information frames, rough sets: an equivalence of categories
- A representation of L-domains by information systems
This page was built for publication: Generalised information systems capture L-domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831140)
