On restricted forms of enumeration reducibility (Q1814011): 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.1016/0168-0072(90)90051-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082068214 / rank | |||
Normal rank | |||
Revision as of 19:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On restricted forms of enumeration reducibility |
scientific article |
Statements
On restricted forms of enumeration reducibility (English)
0 references
25 June 1992
0 references
\(e\)-reducibility is studied in recursion theory. It was introduced in the early 50's but many questions on the structure of \(e\)-degrees remained open up to now. The author considers relations between \(e\)-degrees and degrees based on restricted forms of \(e\)-reducibility. The old result of S. Zakharov is reproved and a few new results are obtained.
0 references
\(e\)-degrees
0 references
\(e\)-reducibility
0 references
