## Parameter Definability in the Recursively Enumerable Degrees

### Cached

### Download Links

by
Andre Nies

Citations: | 34 - 13 self |

### BibTeX

@MISC{Nies_parameterdefinability,

author = {Andre Nies},

title = {Parameter Definability in the Recursively Enumerable Degrees},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

The biinterpretability conjecture for the r.e. degrees asks whether, for each sufficiently large k, the # k relations on the r.e. degrees are uniformly definable from parameters. We solve a weaker version: for each k >= 7, the k relations bounded from below by a nonzero degree are uniformly definable. As applications, we show that...