Effective Borel measurability and reducibility of functions

DOI10.1002/malq.200310125zbMath1059.03074OpenAlexW2141528037MaRDI QIDQ3159400

Publication date: 16 February 2005

Published in: MLQ (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200310125

zbMATH Keywords

Baire space computable analysis discontinuous functions effective descriptive set theory Borel computability computable metric spaces Effectively Borel measurable functions

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Selections in general topology (54C65) Theory of numerations, effectively presented structures (03D45)

Related Items (51)

Three topological reducibilities for discontinuous functions ⋮ On the uniform computational content of the Baire category theorem ⋮ Comparing representations for function spaces in computable analysis ⋮ Effective aspects of Hausdorff and Fourier dimension ⋮ Non-collapse of the effective Wadge hierarchy ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Towards a descriptive set theory for domain-like structures ⋮ Computability and Analysis, a Historical Approach ⋮ On the existence of a connected component of a graph ⋮ Weihrauch Degrees of Finding Equilibria in Sequential Games ⋮ Towards the Effective Descriptive Set Theory ⋮ A topological view on algebraic computation models ⋮ Primitive recursive reverse mathematics ⋮ On computability and disintegration ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ On the uniform computational content of computability theory ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ Closed choice and a uniform low basis theorem ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Hierarchies of function classes defined by the first-value operator ⋮ Singular coverings and non‐uniform notions of closed set computability ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Borel complexity and computability of the Hahn-Banach theorem ⋮ Unnamed Item ⋮ 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Computing links and accessing arcs ⋮ Computability and Representations of the Zero Set ⋮ How Incomputable is the Separable Hahn-Banach Theorem? ⋮ Singular Coverings and Non-Uniform Notions of Closed Set Computability ⋮ Revising Type-2 Computation and Degrees of Discontinuity ⋮ On the topological aspects of the theory of represented spaces ⋮ Computability, noncomputability, and hyperbolic systems ⋮ On the (semi)lattices induced by continuous reducibilities ⋮ A computable version of Banach's inverse mapping theorem ⋮ Unnamed Item ⋮ Weihrauch degrees, omniscience principles and weak computability ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computability of the Radon-Nikodym Derivative ⋮ Decomposing Borel functions using the Shore–Slaman join theorem ⋮ Turing degrees in Polish spaces and decomposability of Borel functions ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE ⋮ Probabilistic computability and choice ⋮ Computability of Subsets of Metric Spaces ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency ⋮ Non-collapse of the effective wadge hierarchy

Cites Work

This page was built for publication: Effective Borel measurability and reducibility of functions