The complexity of index sets of classes of computably enumerable equivalence relations (Q2976337)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of index sets of classes of computably enumerable equivalence relations |
scientific article; zbMATH DE number 6709188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of index sets of classes of computably enumerable equivalence relations |
scientific article; zbMATH DE number 6709188 |
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
0 references
0.8865756392478943
0 references
0.883865475654602
0 references
0.8469576835632324
0 references
0.8431193232536316
0 references
0.8419345021247864
0 references
