Toward an infinitary logic of domains: Abramsky logic for transition systems

DOI10.1006/inco.1999.2827zbMath1004.03030OpenAlexW2062220068MaRDI QIDQ1854320

Marcello M. Bonsangue, Joost N. Kok

Publication date: 14 January 2003

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

Full work available at URL: https://semanticscholar.org/paper/0e30a0fa6c3609c23b9826198c0cf7ea511587a1

zbMATH Keywords

bisimulationtransition systemssober spacessaturated setsLindenbaum algebradomain logicrecursive domain equation

Mathematics Subject Classification ID

Logic in computer science (03B70) Logical aspects of lattices and related structures (03G10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Continuous lattices and posets, applications (06B35)

Related Items

Infinite intersection types ⋮ A logic for Lawson compact algebraic L-domains ⋮ Continuous L-domains in logical form ⋮ Domain mu-calculus ⋮ Bounded complete domains and their logical form

Cites Work

• Duality beyond sober spaces: Topological spaces and observation frames
• A calculus of communicating systems
• Algebraic semantics
• Domain theory in logical form
• A domain equation for bisimulation
• Algebraic laws for nondeterminism and concurrency
• Free Completely Distributive Lattices
• Processes and the denotational semantics of concurrency
• Topological representations of distributive lattices and Brouwerian logics
• Completely Distributive Complete Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item