The branching theorem and computable categoricity in the Ershov hierarchy (Q887636)

From MaRDI portal
Revision as of 23:44, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references