We give a new characterization of sober spaces in terms of their completely distributive lattice of saturated sets. This characterization is used to extend Abramsky's results about a domain logic for transition systems. The Lindenbaum algebra generated by the Abramsky nitary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We prove that the Lindenbaum algebra generated by the in nitary logic is a completely distributive lattice dual to the same SFP-domain. As a consequence soundness and completeness of the in nitary logic is obtained for a class of transition systems that is computational interesting.
Soundness and completeness of an infinitary modal logic for transition systems has been proved in REF using a topological duality.
Towards an infinitary logic of domains: Abramsky logic for transition systems
Inform. and Comput
Mathematics Computer Science