Related papers: Cauchy filters from Pelant's games
We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…
We investigate the problem of type isomorphisms in the presence of higher-order references. We first introduce a finitary programming language with sum types and higher-order references, for which we build a fully abstract games model…
Some aspects of Cauchy integrals on sets with dimension larger than 1 are briefly discussed.
The space of finite games can be decomposed into three orthogonal subspaces [5], which are the subspaces of pure potential games, nonstrategic games and pure harmonic games. The orthogonal projections onto these subspaces are represented as…
In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical…
While the classic separable quotient problem remains open, we survey general results related to this problem and examine the existence of a particular infinitedimensional separable quotient in some Banach spaces of vector-valued functions,…
The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS). Two semantics have been studied for this logic, both assigning to every…
We study the Cauchy problem for a general homogeneous linear partial differential equation in two complex variables with constant coefficients and with divergent initial data. We state necessary and sufficient conditions for the summability…
In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the…
Cirquent calculus is a proof system manipulating circuit-style constructs rather than formulas. Using it, this article constructs a sound and complete axiomatization CL16 of the propositional fragment of computability logic (the…
We study completeness of a topological vector space with respect to different filters on the set N of all naturals. In the metrizable case all these kinds of completeness are the same, but in non-metrizable case the situation changes. For…
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
We consider games played on an infinite probabilistic arena where the first player aims at satisfying generalized B\"uchi objectives almost surely, i.e., with probability one. We provide a fixpoint characterization of the winning sets and…
Pellet's theorem determines when the zeros of a polynomial can be separated into two regions, according to their moduli. We refine one of those regions and replace it with the closed interior of a lemniscate that provides more precise…
In this paper we consider partial metric spaces in the sense of O'Neill. We introduce the notions of strong partial metric spaces and Cauchy functions. We prove a fixed point theorem for such spaces and functions that improves Matthews'…
In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…
The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games,…
Let M be a complete metric space. It is proved that if the space or scalar-valued bounded continuous functions on M admits an isometric shift, then M is separable.
Characterizations of paracompact finite $C$-spaces via continuous selections are given. We apply these results to obtain some properties of finite $C$-spaces. Factorization theorems and a completion theorem for finite $C$- spaces are also…
Under what conditions do the behaviors of players, who play a game repeatedly, converge to a Nash equilibrium? If one assumes that the players' behavior is a discrete-time or continuous-time rule whereby the current mixed strategy profile…