Related papers: A comparison of concepts from computable analysis …

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

The well known ideal presentations of countably based domains were recently extended to (effective) quasi-Polish spaces. Continuing these investigations, we explore some classes of effective quasi-Polish spaces. In particular, we prove an…

We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are…

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

An \'{e}tale space over a topological space $Y$ is defined as a local homeomorphism from a topological space $X$ into $Y$. They often come up in topos theory because of the equivalence between sheaves and \'{e}tale spaces over a space. In…

We show some basic results on the characterization of quasi-Polish spaces in terms of spaces of ideals, with an emphasis on the connections with computable topology.

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

A basic concept of Type Two Theory of Effectivity (TTE) is the notion of an admissibly represented space. Admissibly represented spaces are closely related to qcb-spaces. The latter form a well-behaved subclass of topological spaces. We…

This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…

This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…

In this paper we look at normed spaces of differentiable functions on compact plane sets, including the spaces of infinitely differentiable functions originally considered by Dales and Davie. For many compact plane sets the classical…

The paper tries to extend results of the classical Descriptive Set Theory to as many countably based T_0-spaces (cb_0-spaces) as possible. Along with extending some central facts about Borel, Luzin and Hausdorff hierarchies of sets we…

A metric space $\mathbf{X}$ is called densely complete if there exists a dense set $D$ in $\mathbf{X}$ such that every Cauchy sequence of points of $D $ converges in $\mathbf{X}$. One of the main aims of this work is to prove that the…

Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…

Descriptive set theory was originally developed on Polish spaces. It was later extended to $\omega$-continuous domains [Selivanov 2004] and recently to quasi-Polish spaces [de Brecht 2013]. All these spaces are countably-based. Extending…

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…