The complexity of computable categoricity (Q471691)

From MaRDI portal
Revision as of 07:56, 9 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 complexity of computable categoricity
scientific article

    Statements

    title
    The complexity of computable categoricity (English)
    0 references
    author
    Rodney G. Downey
    0 references
    Asher M. Kach
    0 references
    Steffen Lempp
    0 references
    Andrew E. M. Lewis-Pye
    0 references
    Antonio Montalbán
    0 references
    Daniel D. Turetsky
    0 references
    publication date
    17 November 2014
    0 references
    Mathematics Subject Classification ID
    03C57
    0 references
    03C35
    0 references
    03D45
    0 references
    03D60
    0 references
    zbMATH DE Number
    6370009
    0 references
    zbMATH Keywords
    computable categoricity
    0 references
    OpenAlex ID
    W2009042084
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q471691&oldid=35422682"
    Powered by MediaWiki