Low basis theorem
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
- Theory of Computing Systems
- 2017
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic… (More)
Is this relevant?
2012
2012
- Ann. Pure Appl. Logic
- 2012
We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed… (More)
Is this relevant?
2012
2012
- ArXiv
- 2012
The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
- CCA
- 2009
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we… (More)
Is this relevant?
2009
2009
- J. Symb. Log.
- 2009
We use the Low Basis Theorem of Jockusch and Soare to show that all computable algebraic fields are d-computably categorical for… (More)
Is this relevant?
2008
2008
- Theory of Computing Systems
- 2008
The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a… (More)
Is this relevant?
2008
2008
- 2008
The main goal of this paper is to put some known results in a common perspective and to simplify their proofs. We start with a… (More)
Is this relevant?
Review
2005
Review
2005
- 2005
We extend the Shoenfield jump inversion theorem to the members of any Π1 class P ⊆ 2 with nonzero measure; i.e., for every Σ2 set… (More)
Is this relevant?
2002