Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262)

From MaRDI portal
Revision as of 10:27, 12 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
Program Size Complexity of Correction Grammars in the Ershov Hierarchy
scientific article

    Statements

    title
    Program Size Complexity of Correction Grammars in the Ershov Hierarchy (English)
    0 references
    author
    James S. Royer
    0 references
    John Case
    0 references
    publication date
    17 August 2016
    0 references
    cites work
    Q3862379
    0 references
    Q5320764
    0 references
    Q4934564
    0 references
    Q5573961
    0 references
    Q3069633
    0 references
    Q3819052
    0 references
    Proof theory. 2nd ed
    0 references
    Q4202962
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03D15
    0 references
    03D25
    0 references
    03D55
    0 references
    68Q42
    0 references
    zbMATH DE Number
    6617651
    0 references
    OpenAlex ID
    W2467208211
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3188262&oldid=36267874"
    Powered by MediaWiki