The branching theorem and computable categoricity in the Ershov hierarchy (Q887636): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:58, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The branching theorem and computable categoricity in the Ershov hierarchy |
scientific article |
Statements
The branching theorem and computable categoricity in the Ershov hierarchy (English)
0 references
27 October 2015
0 references
computable categoricity
0 references
Ershov hierarchy
0 references
\(F_a\)-categoricity
0 references
\(G_a\)-categoricity
0 references
branching structure
0 references
