We show that the category of basic pairs (BP) and the category of concrete spaces (CSpa) are both small-complete and small-cocomplete in the framework of constructive Zermelo–Frankel set theory extended with the set generation axiom. We also show that CSpa is a coreflective subcategory of BP.

Every co-c.e. closed set (Π01 class) in Cantor space is represented by a co-c.e. tree. Our aim is to clarify the interaction between the Medvedev and Muchnik degrees of co-c.e. closed subsets of Cantor space and the Turing degrees of their co-c.e. representations. Among other results, we present the following theorems: if v and w are different c.e. degrees, then the collection of the Medvedev (Muchnik) degrees of all Π01 classes represented by v and the collection represented by w are also different; the ideals generated from such collections are also different; the collections of the Medvedev and Muchnik degrees of all Π01 classes represented by incomplete co-c.e. sets are upward dense; the collection of all Π01 classes represented by K-trivial sets is Medvedev-bounded by a single Π01 class represented by an incomplete co-c.e. set; and the Π01 classes have neither nontrivial infinite suprema nor infima in the Medvedev lattice.

In this paper, we develop a general framework for continuous data representations using positive predicate structures. We first show that basic principles of Σ-definability which are used to investigate computability, i.e., existence of a universal Σ-predicate and an algorithmic characterization of Σ-definability hold on all predicate structures without equality. Then we introduce positive predicate structures and show connections between these structures and effectively enumerable topological spaces. These links allow us to study computability over continuous data using logical and topological tools.

It is known that if K is a compact subset of the (separable complete) metric Urysohn space (${\mathbb U}$, d) and f is a Katětov function on the subspace K of (${\mathbb U}$, d), then there is z ∈ ${\mathbb U}$ such that d(z, x) = f(x) for all x ∈ K.

Answering a question of Normann, we show in this article that the supseparable bicomplete q-universal ultrahomogeneous T0-quasi-metric space (q${\mathbb U}$, D) recently discussed by the authors satisfies a similar property for Katětov function pairs on subsets that are compact in the associated metric space (q${\mathbb U}$, Ds).

The importance of an abstract approach to a computation theory over general data types has been stressed by Tucker in many of his papers. Berger and Seisenberger recently elaborated the idea for extraction out of proofs involving (only) abstract reals. They considered a proof involving coinduction of the proposition that any two reals in [−1, 1] have their average in the same interval, and informally extract a Haskell program from this proof, which works with stream representations of reals. Here we formalize the proof, and machine extract its computational content using the Minlog proof assistant. This required an extension of this system to also take coinduction into account.

The structure of the Wadge degrees on zero-dimensional spaces is very simple (almost well ordered), but for many other natural nonzero-dimensional spaces (including the space of reals) this structure is much more complicated. We consider weaker notions of reducibility, including the so-called Δ0α-reductions, and try to find for various natural topological spaces X the least ordinal αX such that for every αX ⩽ β < ω1 the degree-structure induced on X by the Δ0β-reductions is simple (i.e. similar to the Wadge hierarchy on the Baire space). We show that αX ⩽ ω for every quasi-Polish space X, that αX ⩽ 3 for quasi-Polish spaces of dimension ≠ ∞, and that this last bound is in fact optimal for many (quasi-)Polish spaces, including the real line and its powers.

We use Gödel's dialectica interpretation to produce a computational version of the well-known proof of Ramsey's theorem by Erdős and Rado. Our proof makes use of the product of selection functions, which forms an intuitive alternative to Spector's bar recursion when interpreting proofs in analysis. This case study is another instance of the application of proof theoretic techniques in mathematics.

This paper is a further investigation of a project carried out in Didehvar and Ghasemloo (2009) to study effective aspects of the metric logic. We prove an effective version of the omitting types theorem. We also present some concrete computable constructions showing that both the separable atomless probability algebra and the rational Urysohn space are computable metric structures.

We define and study hierarchies of topological spaces induced by the classical Borel and Luzin hierarchies of sets. Our hierarchies are divided into two classes: hierarchies of countably based spaces induced by their embeddings into Pω, and hierarchies of spaces (not necessarily countably based) induced by their admissible representations. We concentrate on the non-collapse property of the hierarchies and on the relationships between hierarchies in the two classes.