English

Isomorphism Theorems between Models of Mixed Choice (Revised)

Logic in Computer Science 2025-06-30 v2 Functional Analysis Probability

Abstract

We relate the so-called powercone models of mixed non-deterministic and probabilistic choice proposed by Tix, Keimel, Plotkin, Mislove, Ouaknine, Worrell, Morgan, and McIver, to our own models of previsions. Under suitable topological assumptions, we show that they are isomorphic. We rely on Keimel's cone-theoretic variants of the classical Hahn-Banach separation theorems, using functional analytic methods, and on the Schr\"oder-Simpson Theorem. Lemma 3.4 in the original 2017 version, published at MSCS, had a wrong proof, and we prove a repaired, albeit slightly less general version here.

Cite

@article{arxiv.2411.13500,
  title  = {Isomorphism Theorems between Models of Mixed Choice (Revised)},
  author = {Jean Goubault-Larrecq},
  journal= {arXiv preprint arXiv:2411.13500},
  year   = {2025}
}

Comments

Fixes a mistake in a "Isomorphism Theorems between Models of Mixed Choice" published at MSCS in 2017. 50 pages, 2 figures. Typos corrected

R2 v1 2026-06-28T20:06:46.904Z