Selected papers of the conference "Continuity, Computability, Constructivity – From Logic to Algorithms" (CCC 2015)

Editors: Ulrich Berger, Willem Fouché, Arno Pauly, Dieter Spreen, Martin A. Ziegler


1. Borel-piecewise continuous reducibility for uniformization problems

Kihara, Takayuki.
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of $G_\delta$-piecewise continuity, and then we […]

2. Existence of strongly proper dyadic subbases

Tsukamoto, Yasuyuki.
We consider a topological space with its subbase which induces a coding for each point. Every second-countable Hausdorff space has a subbase that is the union of countably many pairs of disjoint open subsets. A dyadic subbase is such a subbase with a fixed enumeration. If a dyadic subbase is given, […]

3. Characterization theorem for the conditionally computable real functions

Georgiev, Ivan.
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable real functions with respect to the same class of operators is […]

4. First Order Theories of Some Lattices of Open Sets

Kudinov, Oleg ; Selivanov, Victor.
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first order theory of the lattice of effectively open sets is […]