z-logo
open-access-imgOpen Access
Almost Every Domain is Universal
Author(s) -
Manfred Droste,
Dietrich Kuske
Publication year - 2007
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2007.02.030
Subject(s) - mathematics , probabilistic logic , domain (mathematical analysis) , homogeneous , lattice (music) , discrete mathematics , universal set , probability measure , domain theory , pure mathematics , set (abstract data type) , computer science , combinatorics , mathematical analysis , statistics , physics , acoustics , programming language
We endow the collection of ω-bifinite domains with the structure of a probability space, and we will show that in this space the collection of all universal domains has measure 1. For this, we present a probabilistic way to extend a finite partial order by one element. Applying this procedure iteratively, we obtain an infinite partial order. We show that, with probability 1, the cpo-completion of this infinite partial order is the universal homogeneous ω-bifinite domain. By alternating the probabilistic one-point extension with completion procedures we obtain almost surely the universal and homogeneous ω-algebraic lattice, ω-Scott domain, and ω-bifinite L-domain, respectively.We also show that in the projective topology, the set of universal and homogeneous ω-bifinite domains is residual (i.e., comeagre), and we present an explicit number-theoretic construction of such a domain

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom