Linear logic by levels and bounded time complexity (Q1044841)

From MaRDI portal
Revision as of 07:48, 2 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
Linear logic by levels and bounded time complexity
scientific article

    Statements

    title
    Linear logic by levels and bounded time complexity (English)
    0 references
    author
    Patrick Baillot
    0 references
    Damiano Mazza
    0 references
    publication date
    15 December 2009
    0 references
    zbMATH DE Number
    5647936
    0 references
    zbMATH Keywords
    implicit computational complexity
    0 references
    light linear logics
    0 references
    type systems for polynomial time
    0 references
    OpenAlex ID
    W2091581695
    0 references
    cites work
    Q5565113
    0 references
    Q4842980
    0 references
    Q5815602
    0 references
    Linear logic
    0 references
    Q4896506
    0 references
    Light linear logic
    0 references
    Q3548540
    0 references
    Q4850553
    0 references
    Q3142166
    0 references
    Q4945245
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1044841&oldid=35143484"
    Powered by MediaWiki