The low basis theorem in computability theory states that every nonempty class in (see arithmetical hierarchy) contains a set of low degree (Soareâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
- 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

- Vasco Brattka, Matthew de Brecht, Arno Pauly
- 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

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

- Vasco Brattka, Guido Gherardi
- 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

- Russell Miller
- 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

- Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin
- 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

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

- ROD DOWNEY, Joseph S. Miller
- 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