THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER

We prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this purpose, a specific class of countable 2-colored posets $\mathbb{P}_{emb} $ equipped with the order induced by homomorphisms is embedded into the Wadge order on the $\Delta _2^0 $-degrees of the Scott domain. We then show that $\mathbb{P}_{emb} $ admits both infinite strictly decreasing chains and infinite antichains with respect to this notion of comparison, which therefore transfers to the Wadge order on the $\Delta _2^0 $-degrees of the Scott domain.

Measurements and Gδ-Subsets of Domains

In this paper we study domains, Scott domains, and the existence of measurements. We use a space created by D. K. Burke to show that there is a Scott domain P for which max(P) is a Gδ-subset of P and yet no measurement μ on P has ker(μ) = max(P). We also correct a mistake in the literature asserting that [0, ω1) is a space of this type. We show that if P is a Scott domain and X ⊆ max(P) is a Gδ-subset of P, then X has a Gδ-diagonal and is weakly developable. We show that if X ⊆ max(P) is a Gδ-subset of P, where P is a domain but perhaps not a Scott domain, then X is domain-representable, first-countable, and is the union of dense, completely metrizable subspaces. We also show that there is a domain P such that max(P) is the usual space of countable ordinals and is a Gδ-subset of P in the Scott topology. Finally we show that the kernel of a measurement on a Scott domain can consistently be a normal, separable, non-metrizable Moore space.

On categories generalizing universal domains

Scott domains, originated and commonly used in formal semantics of computer languages, were generalized by J. Adámek to Scott complete categories. We prove that the categorical counterpart of the result of D. Scott – the existence of a countable based Scott domain universal with respect to all countably based Scott domains – is no longer valid for the categorical generalization. However, all obstacles disappear if the notion of the Scott complete category is weakened to a categorical counterpart of bifinite domains.