Full Lambek calculus with contraction is undecidable

Journal of Symbolic Logic 81 (2):524-540 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,951

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Full Lambek Calculus in natural deduction.Ernst Zimmermann - 2010 - Mathematical Logic Quarterly 56 (1):85-88.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
Most Simple Extensions of Are Undecidable.Nikolaos Galatos & Gavin St John - 2022 - Journal of Symbolic Logic 87 (3):1156-1200.
Language-Theoretic and Finite Relation Models for the (Full) Lambek Calculus.Christian Wurm - 2017 - Journal of Logic, Language and Information 26 (2):179-214.
An Undecidable Superintuitionistic Propositional Calculus.B. F. Wells & S. V. Popov - 1985 - Journal of Symbolic Logic 50 (4):1081-1083.
An undecidable two sorted predicate calculus.A. B. Slomson - 1969 - Journal of Symbolic Logic 34 (1):21-23.

Analytics

Added to PP
2016-06-30

Downloads
35 (#729,655)

6 months
5 (#876,395)

Historical graph of downloads
How can I increase my downloads?