THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2976337): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Classical recursion theory. Vol. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computably enumerable equivalence relations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Periodicity in generations of automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on Positive Equivalence Relations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibilities among equivalence relations induced by recursively enumerable structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs realised by r.e. equivalence relations / rank | |||
Normal rank | |||
Latest revision as of 18:41, 13 July 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
0 references
