Related papers: Computability of Separation Axioms in Countable Se…
In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countable $T_0$ space is admissible with respect to the topology…
This paper concerns the self-similarity of topological spaces, in the sense defined in math.DS/0411344. I show how to recognize self-similar spaces, or more precisely, universal solutions of self-similarity systems. Examples include the…
This thesis addresses Pour-El and Richards' fourth question from their book "Computability in analysis and physics", concerning the relation between higher order recursion theory and computability in analysis. Among other things it is shown…
A central topic in mathematical logic is the classification of theorems from mathematics in hierarchies according to their logical strength. Ideally, the place of a theorem in a hierarchy does not depend on the representation (aka coding)…
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…
We study some variations of the product topology on families of clopen subsets of $2^{\mathbb{N}}\times\mathbb{N}$ in order to construct countable nodec regular spaces (i.e. in which every nowhere dense set is closed) with analytic topology…
A regular separable first-countable countably compact space is called a Nyikos space. In this paper, we give a partial solution to an old problem of Nyikos by showing that each locally compact Nyikos inverse topological semigroup is…
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
A. V. Arhangel'ski\u{i} introduced in 2012, when he was visiting the department of Mathematics at King Abduaziz University, new weaker versions of normality, called \it $C$-normality, \rm and \it countable normality. \rm The purpose of this…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…
We study here the topology of information on the space of probability measures over Polish spaces that was defined in [1]. We show that under this topology, a convergent sequence of probability measures satisfying a conditional independence…
The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $\delta$ on the space $\mathcal{S}$ of coarse similarity classes defined by letting…
Given a compact metric space $X$, we associate to it an inverse sequence of finite $T_0$ topological spaces. The inverse limit of this inverse sequence contains a homeomorphic copy of $X$ that is a strong deformation retract. We provide a…
We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to characterize the notion of computable type arising from computability…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
Computation fundamentally separates time from space: nondeterministic search is exponential in time but polynomially simulable in space (Savitch's Theorem). We propose that the brain physically instantiates a biological variant of this…
We demonstrate that a reproducing kernel Hilbert or Banach space of functions on a separable absolute Borel space or an analytic subset of a Polish space is separable if it possesses a Borel measurable feature map.