Lowness for genericity (Q818521): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00153-005-0306-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139507368 / rank | |||
Normal rank | |||
Revision as of 18:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lowness for genericity |
scientific article |
Statements
Lowness for genericity (English)
0 references
21 March 2006
0 references
Starting from the Nitzpon's definition of lowness for 1-genericity, the author shows that there is no Turing degree which is low for 1-genericity. He also proves partially Nitzpron's conjecture: the hyperimmune-free degrees are the same as the degrees low for weak 1-genericity. So, with Miller, the author proves that every computable traceable degree is low for weak 1-genericity.
0 references
Turing degree structures
0 references
