Scott Continuity in Generalized Probabilistic Theories

Robustness, Scott Continuity, and Computability

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 ro…

Mathematics of Domains

Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed. Domains are equipped with Scott topology and represent data types. Scott continuous functions represent computable functions and form the most popular continuous model of computations. Covariant Logic of Domains: Domains are represented as sets of theories, and Scott continuous functions are represented as input-output inference engines. The questions addressed are: A. What constitutes a subdomain? Do subdomains of a given domain $A$ form a domain? B. Which retractions are …

Join-continuity + Hypercontinuity = Prime continuity

A remarkable result due to Kou, Liu & Luo states that the condition of continuity for a dcpo can be split into quasi-continuity and meet-continuity. Their argument contained a gap, however, which is probably why the authors of the monograph Continuous Lattices and Domains used a different (and fairly sophisticated) sequence of lemmas in order to establish the result. In this note we show that by considering the Stone dual, that is, the lattice of Scott-open subsets, a straightforward proof may be given. We do this by showing that a complete lattice is prime-continuous if and only if it is join…

概率互模拟距离的连续性

On the Continuity of the Probabilistic Bisimilarity Distance

本文证明鲁棒概率互拟是概率互拟距离在零距离处连续性的充要条件，并扩展到非互拟状态对以刻画连续性，提出多项式时间判定算法。

On the linear structure of cones

For encompassing the limitations of probabilistic coherence spaces which do not seem to provide natural interpretations of continuous data types such as the real line, Ehrhard and al. introduced a model of probabilistic higher order computation based on (positive) cones, and a class of totally monotone functions that they called "stable". Then Crubill{é} proved that this model is a conservative extension of the earlier probabilistic coherence space model. We continue these investigations by showing that the category of cones and linear and Scott-continuous functions is a model of intuitionisti…

Approximation in quantale-enriched categories

Our work is a fundamental study of the notion of approximation in V-categories and in (U,V)-categories, for a quantale V and the ultrafilter monad U. We introduce auxiliary, approximating and Scott-continuous distributors, the way-below distributor, and continuity of V- and (U,V)-categories. We fully characterize continuous V-categories (resp. (U,V)-categories) among all cocomplete V-categories (resp. (U,V)-categories) in the same ways as continuous domains are characterized among all dcpos. By varying the choice of the quantale V and the notion of ideals, and by further allowing the ultrafilt…