Related papers: Cauchy filters from Pelant's games
Treatises about General Topology that emphasize the notion of uniformity and uniform space find, of course, no difficulty in defining the notion of a complete uniform space and in constructing the completion of a metric space, via its…
A metric space $\mathbf{X}$ is called densely complete if there exists a dense set $D$ in $\mathbf{X}$ such that every Cauchy sequence of points of $D $ converges in $\mathbf{X}$. One of the main aims of this work is to prove that the…
A classical result of Cembranos and Freniche states that the C(K, X) spaces contains a complemented copy of c_0 whenever K is an infinite compact Hausdorff space and X is an infinite dimensional Banach space. This paper takes this result as…
We show that the problem whether every $1$-separably injective Banach space contains an isomorphic copy of $\ell_\infty$ is undecidable. Namely, unlike under the continuum hypothesis, assuming Martin's axiom and the negation of the…
We investigate for which compactifications $\gamma\omega$ of the discrete space of natural numbers $\omega$, the natural copy of the Banach space $c_0$ is complemented in $C(\gamma\omega)$. We show, in particular, that the separability of…
We propose a refinement of correlated equilibrium based on mediator errors, called correlated perfect equilibrium (CPE). In finite games, the set of CPE is nonempty and forms a finite union of convex sets. Like perfect equilibrium, a CPE…
We study the computational complexity of a robust version of the problem of testing two univariate C-finite functions for eventual inequality at large times. Specifically, working in the bit-model of real computation, we consider the…
We analyze Coquand's game-theoretic interpretation of Peano Arithmetic through the lens of elementary descent recursion. In Coquand's game semantics, winning strategies correspond to infinitary cut-free proofs and cut elimination…
A system of equations consisting of an infinite string coupled to a nonlinear oscillator is considered. The Cauchy problem for the system with the periodic initial data is studied. The main goal is to prove the convergence of the solutions…
Measuring says that for e\-very sequence $(C_\delta)_{\delta<\omega_1}$ with each $C_\delta$ being a closed subset of $\delta$ there is a club $C\subseteq\omega_1$ such that for every $\delta\in C$, a tail of $C\cap\delta$ is either…
We study zero-sum games, a variant of the classical combinatorial Subtraction games (studied for example in the monumental work "Winning Ways", by Berlekamp, Conway and Guy), called Cumulative Subtraction (CS). Two players alternate in…
It is well-known that for infinitely repeated games, there are computable strategies that have best responses, but no computable best responses. These results were originally proved for either specific games (e.g., Prisoner's dilemma), or…
In this paper we investigate lossy channel games under incomplete information, where two players operate on a finite set of unbounded FIFO channels and one player, representing a system component under consideration operates under…
We study the well-posedness of the Cauchy problem for a fractional porous medium equation with a varying density. We establish existence of weak energy solutions; uniqueness and nonuniqueness is studied as well, according with the behavior…
We consider a dynamical approach to game in extensive forms. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding…
In view of the complexity of the dynamics of learning in games, we seek to decompose a game into simpler components where the dynamics' long-run behavior is well understood. A natural starting point for this is Helmholtz's theorem, which…
We define a real-valued distance metric $wd$ on the space $\mathcal{C}$ of short combinatorial games in canonical form. We demonstrate the existence of Cauchy sequences informed by sidling sequences, find limit points, and investigate the…
We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). Formally, we prove lower bounds against the accuracy of FPC-interpretations that map Unique…
Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…
Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two…