Related papers: Cauchy filters from Pelant's games
This paper studies the feedback stabilization of abstract Cauchy problems with unbounded output operators by finite-dimensional controllers. Both necessary conditions and sufficient conditions for feedback stabilizability are presented. The…
We show that in the aleph_2-stage countable support iteration of Mathias forcing over a model of CH the complete Boolean algebra generated by absolutely divergent series under eventual dominance is not isomorphic to the completion of…
We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega$ implies that the modal logic S4.1.2 is complete with respect to the \v{C}ech-Stone compactification of the natural numbers,…
The \emph{stationary set splitting game} is a game of perfect information of length $\omega_{1}$ between two players, \unspls and \spl, in which \unspls chooses stationarily many countable ordinals and \spls tries to continuously divide…
The notion of a \textbf{$\boldsymbol{\mathcal{C}}$-filtered} object, where $\mathcal{C}$ is some (typically small) collection of objects in a Grothendieck category, has become ubiquitous since the solution of the Flat Cover Conjecture…
If $\mu$ is a finite complex measure in the complex plane $\C$ we denote by $C^\mu$ its Cauchy integral defined in the sense of principal value. The measure $\mu$ is called reflectionless if it is continuous (has no atoms) and $C^\mu=0$ at…
We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the…
In this paper we study the Cauchy problem for overdetermined systems of linear partial differential operators with constant coefficients in some spaces of $\omega$-ultradifferentiable functions in the sense of Braun, Meise and Taylor, for…
In this article, we present a new characterization of the completeness of a partial metric space--which we call \textit{orbital characterization}-- using fixed point results.
Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to…
In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not…
The completeness properties of spaces of immersed curves equipped with reparametrization-invariant Riemannian metrics have recently been the subject of active research. This thesis studies the metric completion of spaces of immersed open…
In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pt\'ak. We show that the validity of the result for $\omega_1$ can not be decided in ZFC alone. We also provide a…
We analyze both finite and infinite systems of Riccati equations derived from stochastic differential games on infinite networks. We discuss a connection to the Catalan numbers and the convergence of the Catalan functions by Fourier…
This paper is a continuation of the study of topological properties of omega context free languages (omega-CFL). We proved before that the class of omega-CFL exhausts the hierarchy of Borel sets of finite rank, and that there exist some…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
Observable games are game situations that reach one of possibly many Nash equilibria. Before an instance of the game starts, an external observer does not know, a priori, what is the exact profile of actions that will occur; thus, he…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
We prove Cauchy's formula for repeated integration on time scales. The obtained relation gives rise to new notions of fractional integration and differentiation on arbitrary nonempty closed sets.
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…