Disjunctive systems and L-Domains

DOI10.1007/3-540-55719-9_81zbMath1425.68244OpenAlexW1575743174MaRDI QIDQ5204324

No author found.

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_81

Mathematics Subject Classification ID

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

Related Items (11)

Representations of algebraic domains and algebraic L-domains by information systems ⋮ A note on finitely derived information systems ⋮ Generalised information systems capture L-domains ⋮ Consistent disjunctive sequent calculi and Scott domains ⋮ A logical approach to stable domains ⋮ Stone duality and representation of stable domain ⋮ A representation of L-domains by information systems ⋮ Representation of algebraic domains by formal association rule systems ⋮ Various Constructions of Continuous Information Systems ⋮ A representation of proper BC domains based on conjunctive sequent calculi ⋮ Bounded complete domains and their logical form

Cites Work

• Linear logic
• Cartesian closed categories of algebraic cpos
• The largest Cartesian closed category of domains
• Non-deterministic information systems and their domains
• Categories of embeddings
• A representation of SFP
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjunctive systems and L-Domains