The Vitali Covering Theorem in the Weihrauch Lattice
From MaRDI portal
Publication:2970958
DOI10.1007/978-3-319-50062-1_14zbMath1485.03241arXiv1605.03354OpenAlexW2350408705MaRDI QIDQ2970958
Guido Gherardi, Arno Pauly, Vasco Brattka, Rupert Hölzl
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.03354
Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other connections with logic and set theory (28E15) Computation over the reals, computable analysis (03D78)
Related Items (16)
Unnamed Item ⋮ Completion of choice ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Embeddings between well-orderings: computability-theoretic reductions ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ On the algebraic structure of Weihrauch degrees ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Continuous and monotone machines ⋮ Weihrauch and constructive reducibility between existence statements ⋮ COH, SRT 2 2 , and multiple functionals ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ Unnamed Item ⋮ Bishop-Style Constructive Reverse Mathematics ⋮ Weihrauch Complexity in Computable Analysis
Cites Work
- 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
- How incomputable is the separable Hahn-Banach theorem?
- Vitali's theorem and WWKL
- On the uniform computational content of computability theory
- Probabilistic computability and choice
- On uniform relationships between combinatorial problems
- Las Vegas Computability and Algorithmic Randomness
- On the (semi)lattices induced by continuous reducibilities
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- The Vitali covering theorem in constructive mathematics
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
- On the topological aspects of the theory of represented spaces
This page was built for publication: The Vitali Covering Theorem in the Weihrauch Lattice
