Number of the records: 1  

Full Lambek Calculus with Contraction is Undecidable

  1. 1.
    SYSNO0442807
    TitleFull Lambek Calculus with Contraction is Undecidable
    Author(s) Chvalovský, Karel (UIVT-O) SAI, RID, ORCID
    Horčík, Rostislav (UIVT-O) SAI, RID
    Source Title Journal of Symbolic Logic. Roč. 81, č. 2 (2016), s. 524-540. - : Cambridge University Press
    Document TypeČlánek v odborném periodiku
    Grant GAP202/11/1632 GA ČR - Czech Science Foundation (CSF)
    Institutional supportUIVT-O - RVO:67985807
    Languageeng
    CountryUS
    Keywords substructural logic * full Lambek calculus * contraction rule * square-increasing residuated lattice * equational theory * decidability
    Permanent Linkhttp://hdl.handle.net/11104/0245628
    FileDownloadSizeCommentaryVersionAccess
    a0442807.pdf8369.7 KBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.