2022/08/25 by Amin Farjudian, Farjudian, Amin, Eugenio Moggi +1 · 1 citation
Computer Science · Mathematics · #06B35 #18B35 #46B50 #54D30 #Advanced Algebra and Logic #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
paper · pdf · doi:10.48550/arxiv.2208.12347
openalex publication_date 2022/08/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system's state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust analyses cannot discriminate between a subset of the metric space and its closure, therefore one can restrict to the complete lattice of closed subsets. When the metric space is compact, the complete lattice of closed subsets ordered by reverse inclusion is w-continuous and robust analyses are exactly the Scott continuous maps. Thus, one can also ask whether a robust analysis is computable (with respect to a countable base). The main result of this paper establishes a relation between robustness and Scott continuity, when the metric space is not compact. The key idea is to replace the metric space with a compact Hausdorff space, and relate robustness and Scott continuity by an adjunction between the complete lattice of closed subsets of the metric space and the w-continuous lattice of closed subsets of the compact Hausdorff space. We demonstrate the applicability of this result with several examples involving Banach spaces.