Finite-valuation approximable structures: a solution to the Jung--Tix problem of probabilistic powerdomains
Yuxu Chen, Hui Kou, Zhenchao Lyu
Abstract
We introduce the category ω FVA of finite-valuation approximable domains, a full subcategory of continuous domains contained in the category of pointed countably based FS-domains. We prove that ω FVA is Cartesian closed and closed under both the subprobabilistic and probabilistic valuation powerdomains. Hence the valuation monads V≤ 1 and V1 restrict to ω FVA, yielding a positive answer to the category-existence form of the Jung--Tix problem, a long-standing open problem in domain theory since the 1990s. In particular, we develop a new factorization-approximation framework for constructing objects from a given class of known objects or structures. Applying this method to the class of subprobabilistic powerdomains over finite posets, we construct the class ω FVA and show that it is closed under Scott-continuous retracts, finite products, function spaces, V≤ 1 and V1 monads.
Create a lesson
Related papers
MightyPPL : Towards model checking MTL
Hsi-Ming Ho, Shankara Narayanan Krishna, Khushraj Madnani et al.
Counting on Nowhere Dense Classes
Steffen van Bergerem, Nicole Schweikardt
Towards a Proof-Theoretic Analysis of Incorrect/Incomplete Proofs
Matthias Baaz, Mariami Gamsakhurdia
Descriptive Complexity in Lean: Completeness by First-Order Reductions
Pierre Senellart, Anton Gnatenko
Predictable Modelling and Analysis of Software-defined Vehicle Implementations
Pavlo Tokariev, Yosri Ayari, Julien Deantoni
Refining Timing Uncertainty from Logical Time Specification to Operation
Pavlo Tokariev, Julien Deantoni