Related papers: Cauchy filters from Pelant's games
A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma \subseteq \mbox{Th}(K; \mathcal{L})$. We adapt arguments originating with Cherlin-van den…
Nevanlinna showed that Cauchy transforms of probability measures parametrize all functions from the upper half plane into itself satisfying a certain asymptotic condition at infinity. We show that the correspondence fails in general for the…
There exists a completely metrizable bounded metrizable space $X$ with compatible metrics $d,d'$ so that the hyperspace $CL(X)$ of nonempty closed subsets of $X$ endowed with the Hausdorff metric $H_d$, $H_{d'}$, resp. is…
The main goal of the paper is the full proof of a cardinal inequality for a space with points $G_\delta $, obtained with the help of a long version of the Menger game. This result, which improves a similar one of Scheepers and Tall, was…
We use a generic notion of flatness in the enriched context to define various completions of metric spaces -- enrichments over [0,\infty] -- and preorders -- enrichments over 2. We characterize the weights of colimits commuting in…
We characterize winning strategies in various infinite games involving filters on the natural numbers in terms of combinatorics or structural properties of the given filter. These generalize several ultrafilter games of Galvin.
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main motivation for studying these games comes from the connections…
Starting with a sigma finite measure on an algebra, we define a pseudometric and show how measurable sets from the Caratheodory Extension Theorem can be thought of as limit points of Cauchy sequences in the algebra.
Certain notions of convergence of sequences functions such as pointwise convergence and (uniform) convergence on compact or bounded sets come from suitable topological function spaces; see [1]. Under certain conditions these topologies…
This paper studies the limits of empirical means of open-loop Nash equilibria of linear-quadratic stochastic differential games as the number of players goes to infinity, when the corresponding mean field game is of potential type and may…
This work is a contribution to the study of rewrite games. Positions are finite words, and the possible moves are defined by a finite number of local rewriting rules. We introduce and investigate taking-and-merging games, that is, where…
We provide a ZFC example of a compact space K such that C(K)* is w*-separable but its closed unit ball is not w*-separable. All previous examples of such kind had been constructed under CH. We also discuss the measurability of the supremum…
To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert's tenth problem, we consider two further classes of mathematically non-decidable problems, those of a modified version of the Hilbert's tenth…
We prove weighted estimates for the maximal regularity operator. Such estimates were motivated by boundary value problems. We take this opportunity to study a class of weak solutions to the abstract Cauchy problem. We also give a new proof…
This document consists of two parts: the second part was submitted earlier as a new proof of Nash's theorem, and the first part is a note explaining a problem found in that proof. We are indebted to Sergiu Hart and Eran Shmaya for their…
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his…
Using the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and $\omega$-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabelling. Our…
We obtain game-theoretic characterizations for meagerness and rareness of filters on a countable set.
In this survey we revisit {\sc finite subtraction}, one-heap subtraction games on finite rulesets. The main purpose is to give a general overview of the development, and specifically to draw attention to Flammenkamp's thesis (1997), where…
A metric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces, we show that a countable ultrametric…