SearcharxivSearch

arXiv · 1310.6685

Generalized Choquet spaces

Abstract

We introduce an analog to the notion of Polish space for spaces of weight $\leq\kappa$, where $\kappa$ is an uncountable regular cardinal such that $\kappa^{<\kappa}=\kappa$. Specifically, we consider spaces in which player II has a winning strategy in a variant of the strong Choquet game which runs for $\kappa$ many rounds. After discussing the basic theory of these games and spaces, we prove that there is a surjectively universal such space and that there are exactly $2^\kappa$ many such spaces up to homeomorphism. We also establish a Kuratowski-like theorem that under mild hypotheses, any two such spaces of size $>\kappa$ are isomorphic by a $\kappa$-Borel function. We then consider a dynamic version of the Choquet game and show that in this case the existence of a winning strategy for player II implies the existence of a winning tactic, that is, a strategy that depends only on the most recent move. We also study a generalization of Polish ultrametric spaces where the ultrametric is allowed to take values in a set of size $\kappa$. We show that in this context, there is a family of universal Urysohn-type spaces, and we give a characterization of such spaces which are hereditarily $\kappa$-Baire.

Explore related subjects

Keep this discovery

BibTeXRIS

Samuel Coskey, Philipp Schlicht. 2013-10-24. Generalized Choquet spaces. https://doi.org/10.4064/fm924-12-2015

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO