THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2976337): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:20, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS |
scientific article |
Statements
THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (English)
0 references
28 April 2017
0 references
computably enumerable equivalence relation
0 references
computable reducibility on equivalence relations
0 references
