Product-free lambek calculus is NP-complete

Annals of Pure and Applied Logic 163 (7):775-788 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2011.09.017

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

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

Through your library

My notes

Similar books and articles

Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
On reduction systems equivalent to the Lambek calculus with the empty string.Wojciech Zielonka - 2002 - Studia Logica 71 (1):31-46.
The finite model property for BCI and related systems.Wojciech Buszkowski - 1996 - Studia Logica 57 (2-3):303 - 323.
Linear axiomatics of commutative product-free Lambek calculus.Wojciech Zielonka - 1990 - Studia Logica 49 (4):515 - 522.
Lambek calculus and its relational semantics: Completeness and incompleteness. [REVIEW]Hajnal Andréka & Szabolcs Mikulás - 1994 - Journal of Logic, Language and Information 3 (1):1-37.
A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi.Wojciech Zielonka - 1989 - Studia Logica 48 (1):35 - 39.
The Lambek calculus enriched with additional connectives.Makoto Kanazawa - 1992 - Journal of Logic, Language and Information 1 (2):141-171.
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.Michael Kaminski & Nissim Francez - 2014 - Studia Logica 102 (3):479-497.
Lambek calculus with restricted contraction and expansion.Andreja Prijatelj - 1992 - Studia Logica 51 (1):125 - 143.
A rule-extension of the non-associative Lambek calculus.Heinrich Wansing - 2002 - Studia Logica 71 (3):443-451.
Cut-rule axiomatization of the syntactic calculus L.Wojciech Zielonka - 2001 - Journal of Logic, Language and Information 10 (2):339-352.
Categorial grammar.Raffaella Bernardi - unknown

Analytics

Added to PP
2013-10-27

Downloads
41 (#380,229)

6 months
9 (#295,075)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Logical Foundations for Hybrid Type-Logical Grammars.Richard Moot & Symon Jory Stevens-Guille - 2022 - Journal of Logic, Language and Information 31 (1):35-76.
Natural Language Semantics and Computability.Richard Moot & Christian Retoré - 2019 - Journal of Logic, Language and Information 28 (2):287-307.
Complexity of the Lambek Calculus and Its Fragments.Mati Pentus - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 310-329.
Towards NP – P via proof complexity and search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.

Add more citations

References found in this work

The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.

Add more references