Closed choice and a uniform low basis theorem

DOI10.1016/j.apal.2011.12.020zbMath1251.03082arXiv1002.2800OpenAlexW2044009111MaRDI QIDQ424541

Vasco Brattka, Matthew De Brecht, Arno Pauly

Publication date: 1 June 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.2800

zbMATH Keywords

computable functionscomputable analysisBorel complexityclosed choice principlesmodels of hypercomputationWeihrauch reducibility

Mathematics Subject Classification ID

Related Items (48)

On the uniform computational content of the Baire category theorem ⋮ Comparing representations for function spaces in computable analysis ⋮ Reduction games, provability and compactness ⋮ Effective aspects of Hausdorff and Fourier dimension ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Computability and Analysis, a Historical Approach ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ On the existence of a connected component of a graph ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Unnamed Item ⋮ Algebraic properties of the first-order part of a problem ⋮ 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 ⋮ Computable Stone spaces ⋮ On the uniform computational content of computability theory ⋮ Direct construction of Scott ideals ⋮ De groot duality for represented spaces ⋮ On the complexity of learning programs ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Reverse Mathematics of Matroids ⋮ The Vitali Covering Theorem in the Weihrauch Lattice ⋮ Many-one reductions and the category of multivalued functions ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Completion of choice ⋮ Unnamed Item ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ On the algebraic structure of Weihrauch degrees ⋮ On the strength of marriage theorems and uniformity ⋮ Representations of Analytic Functions and Weihrauch Degrees ⋮ On the topological aspects of the theory of represented spaces ⋮ Towards computable analysis on the generalised real line ⋮ Automatic learning from positive data and negative counterexamples ⋮ On uniform relationships between combinatorial problems ⋮ Unnamed Item ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computability of the Radon-Nikodym Derivative ⋮ Decomposing Borel functions using the Shore–Slaman join theorem ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ Probabilistic computability and choice ⋮ Unnamed Item ⋮ Computability of Subsets of Metric Spaces ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Topological properties of concept spaces (full version)
• How incomputable is the separable Hahn-Banach theorem?
• Descriptive set theory
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• A blend of methods of recursion theory and topology.
• Computability on subsets of metric spaces.
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Real hypercomputation and continuity
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• Effective Borel measurability and reducibility of functions
• Undecidability in Weihrauch Degrees
• Borel Complexity of Topological Operations on Computable Metric Spaces
• Plottable Real Number Functions and the Computable Graph Theorem
• Computational complexity on computable metric spaces
• Notions of Probabilistic Computability on Represented Spaces
• Revising Type-2 Computation and Degrees of Discontinuity
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Closed choice and a uniform low basis theorem