Related papers: Computability of Separation Axioms in Countable Se…
Building on our prior work on axiomatization of exact real computation by formalizing nondeterministic first-order partial computations over real and complex numbers in a constructive dependent type theory, we present a framework for…
Answering a question raised by V. V. Tkachuk, we present several examples of $\sigma$-compact spaces, some only consistent and some in ZFC, that are not countably tight but in which the closure of any discrete subset is countably tight. In…
The aim of this paper is to present an elementary computable theory of probability, random variables and stochastic processes. The probability theory is baed on existing approaches using valuations and lower integrals. Various approaches to…
Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…
It is proved that the relation of isomorphism between separable Banach spaces is a complete analytic equivalence relation, i.e., that any analytic equivalence relation Borel reduces to it. Thus, separable Banach spaces up to isomorphism…
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…
Here we present an overview of countably-normed spaces. We discuss the main topologies--weak, strong, and inductive--placed on the dual of a countably-normed space and discuss the sigma-fields generated by these topologies. In particular,…
We consider the space $M(X)$ of separable measures on the Borel $\sigma$-algebra ${\cal B}(X)$ of a metric space $X$. The space $M(X)$ is furnished with the Kantorovich-Rubinshte\u{i}n metric known also as the ``Hutchinson distance''. We…
We propose an interpretation of quantum separability based on a physical principle: local time reversal. It immediately leads to a simple characterization of separable quantum states that reproduces results known to hold for binary…
We introduce and investigate a topological version of St\"ackel's 1907 characterization of finite sets, with the goal of obtaining an interesting notion that characterizes usual compactness (or a close variant of it). Define a $T_2$…
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over "large" topological spaces. This framework has been applied to study the complexity of the differential operator and the…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
All spaces are assumed to be Tychonoff. Given a realcompact space $X$, we denote by $\mathsf{Exp}(X)$ the smallest infinite cardinal $\kappa$ such that $X$ is homeomorphic to a closed subspace of $\mathbb{R}^\kappa$. Our main result shows…
We extend logical categories with fiberwise interior and closure operators so as to obtain an embedding theorem into powers of the category of topological spaces. The required axioms, besides the Kuratowski closure axioms, are a `product…
We give, for some Borel sets of a product of two Polish spaces, including the Borel sets with countable sections, a Hurewicz-like characterization of those which cannot become a transfinite difference of open sets by changing the two Polish…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
A topological space $X$ is said to be {\em $Y$-rigid} if any continuous map $f:X\rightarrow Y$ is constant. In this paper we construct a number of examples of regular countably compact $\mathbb R$-rigid spaces with additional properties…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
Let $G$ be a topological group and let $\mu$ be the Lebesgue measure on the interval $[0,1]$. We let $L_0(G)$ to be the topological group of all $\mu$-equivalence classes of $\mu$-measurable functions defined on [0,1] with values in $G$,…