Parallel and Serial Jumps of Weak Weak König’s Lemma
From MaRDI portal
Publication:2970959
DOI10.1007/978-3-319-50062-1_15zbMath1485.03240OpenAlexW2559146615MaRDI QIDQ2970959
Rutger Kuyper, Laurent Bienvenu
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_15
Constructive and recursive analysis (03F60) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)
Related Items
Cites Work
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- On the uniform computational content of computability theory
- Probabilistic computability and choice
- Weihrauch degrees, omniscience principles and weak computability
- Algorithmic Randomness and Complexity
- On the algebraic structure of Weihrauch degrees
- Continuous higher randomness
- Computability and Randomness