Abstract

This paper introduces stable information systems. Stable information systems determine DI-domains and stable approximable mappings give stable functions, and vice versa. The notation of rigid embedding is captured by a subsystem relation. Under this relation, stable information systems form a cpo. Constructions like lifting, sum, product and function space are proposed which induce continuous functions on the cpo. In this way recursive stable information systems can be defined using fixed point theory

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 call

Disclaimer: 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.