Related papers: Computability on quasi-Polish spaces
Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…
What does it mean to claim that a physical or natural system computes? One answer, endorsed here, is that computing is about programming a system to behave in different ways. This paper offers an account of what it means for a physical…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
We prove that the Reeb space of a proper definable map $f:X \rightarrow Y$ in an arbitrary o-minimal expansion of a real closed field is realizable as a proper definable quotient. This result can be seen as an o-minimal analog of Stein…
We prove that if a quasi-tilted algebra is tame, then the associated moduli spaces are products of projective spaces. Together with an earlier result of Chindris this gives a geometric characterization of the tame quasi-tilted algebras.
In this paper we have obtained two more characterizations of nearly pseudocompact spaces.
We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…
We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…
A classical theorem of Hurewicz characterizes spaces with the Hurewicz covering property as those having bounded continuous images in the Baire space. We give a similar characterization for spaces X which have the Hurewicz property…
Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…
A topological space $X$ is Baire if the intersection of any sequence of open dense subsets of $X$ is dense in $X$. One of the interesting problems for the space of Baire functions is the Banakh-Gabriyelyan problem: Let $\alpha$ be a…
We show a necessary and sufficient condition for any ordinal number to be a Polish space. We also prove that for each countable Polish space, there exists a countable ordinal number that is an upper bound for the first component of the…
It is proved that two useful and apparently different metrics on the set of Borel probabilities on countable products of Polish spaces of bounded diameters are equal. This paves the way for advances in their computation.
According to a result of Kocinac and Scheepers, the Hurewicz covering property is equivalent to a somewhat simpler selection property: For each sequence of large open covers of the space one can choose finitely many elements from each cover…
A space is functionally countable if every real-valued continuous function has countable image. A stronger property recently defined by Tkachuk is exponentially separability. We start by studying these properties in GO spaces, where we…
On a metric measure space satisfying the doubling property, we establish several optimal characterizations of Besov and Triebel-Lizorkin spaces, including a pointwise characterization. Moreover, we discuss their (non)triviality under a…
In this paper we explore some basic properties of quasi-Banach function spaces which are important in applications. Namely, we show that they posses a generalised version of Riesz--Fischer property, that embeddings between them are always…
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…
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…
We study the quasi-order of topological embeddability on definable functions between Polish zero-dimensional spaces. We first study the descriptive complexity of this quasi-order restricted to the space of continuous functions. Our main…