On the uniform computational content of the Baire category theorem

DOI10.1215/00294527-2018-0016zbMath1455.03080arXiv1510.01913OpenAlexW3106086156MaRDI QIDQ1633900

Matthew Hendtlass, Alexander P. Kreuzer, Vasco Brattka

Publication date: 21 December 2018

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsgenericityBaire categorycomputable analysisWeihrauch lattice

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Other Turing degree structures (03D28) Computation over the reals, computable analysis (03D78)

Related Items (5)

Completion of choice ⋮ Unnamed Item ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Unnamed Item ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Closed choice and a uniform low basis theorem
• Diagonally non-computable functions and fireworks
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• How incomputable is the separable Hahn-Banach theorem?
• Computable invariance
• Computability on subsets of metric spaces.
• On the uniform computational content of computability theory
• Probabilistic computability and choice
• Baire categoricity and \(\Sigma_1^0\)-induction
• On uniform relationships between combinatorial problems
• The typical Turing degree
• Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• The Baire category theorem in weak subsystems of second-order arithmetic
• Effective Borel measurability and reducibility of functions
• Algorithmic Randomness and Complexity
• Slicing the Truth
• Borel Complexity of Topological Operations on Computable Metric Spaces
• The atomic model theorem and type omitting
• On the algebraic structure of Weihrauch degrees
• Randomness, relativization and Turing degrees

This page was built for publication: On the uniform computational content of the Baire category theorem