Product-free Lambek calculus is NP-complete (Q408532)

From MaRDI portal
Revision as of 03:36, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Product-free Lambek calculus is NP-complete
scientific article

    Statements

    title
    Product-free Lambek calculus is NP-complete (English)
    0 references
    author
    Yury Savateev
    0 references
    publication date
    10 April 2012
    0 references
    zbMATH Keywords
    Lambek calculus
    0 references
    algorithmic complexity
    0 references
    proof nets
    0 references
    derivability
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03B47
    0 references
    03B25
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6022765
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q408532&oldid=12284897"
    Powered by MediaWiki