Abstract
We consider two problems on representation theory for domains by information systems. The first problem is how to represent continuous semi-lattices as information systems, and the second one is which subclass of the continuous information systems designed by Spreen et al. for continuous domains can be used to represent bounded complete domains. We solve the first problem by defining a notion of SL-information systems. This is a special case of the continuous information systems. We also discuss the morphism part of SL-information systems, which corresponds to Scott-continuous functions between continuous semi-lattices. Noting that each bounded complete domain is a special continuous semi-lattices, we provide a correct solution to the second problem by properly strengthening the conditions of SL-information systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
