The Lambek calculus enriched with additional connectives

Journal of Logic, Language and Information 1 (2):141-171 (1992)
  Copy   BIBTEX

Abstract

Some formal properties of enriched systems of Lambek calculus with analogues of conjunction and disjunction are investigated. In particular, it is proved that the class of languages recognizable by the Lambek calculus with added intersective conjunction properly includes the class of finite intersections of context-free languages.

Categories

Keywords

Reprint years

DOI

10.1007/bf00171695

Other Versions

No versions found

Links

PhilArchive

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

Commutative Lambek Grammars.Tikhon Pshenitsyn - 2023 - Journal of Logic, Language and Information 32 (5):887-936.
Normal form of derivations in the nonassociative and commutative lambek calculus with product.Maciej Kandulski - 1993 - Mathematical Logic Quarterly 39 (1):103-114.
On the Recognizing Power of the Lambek Calculus with Brackets.Makoto Kanazawa - 2018 - Journal of Logic, Language and Information 27 (4):295-312.
On Commutative and Nonassociative Syntactic Calculi and Categorial Grammars.Maciej Kandulski - 1995 - Mathematical Logic Quarterly 41 (2):217-235.
Complexity of the Infinitary Lambek Calculus with Kleene Star.Stepan Kuznetsov - 2021 - Review of Symbolic Logic 14 (4):946-972.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
On the Complexity of Nonassociative Lambek Calculus with Unit.Maria Bulińska - 2009 - Studia Logica 93 (1):1-14.
Language-Theoretic and Finite Relation Models for the (Full) Lambek Calculus.Christian Wurm - 2017 - Journal of Logic, Language and Information 26 (2):179-214.
The finite model property for BCI and related systems.Wojciech Buszkowski - 1996 - Studia Logica 57 (2-3):303-323.
Non‐associative Lambek Categorial Grammar in Polynomial Time.Erik Aarts & Kees Trautwein - 1995 - Mathematical Logic Quarterly 41 (4):476-484.

Analytics

Added to PP
2009-01-28

Downloads
120 (#389,325)

6 months
44 (#192,420)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Substructural Logics: A Primer.Francesco Paoli - 2002 - Dordrecht, Netherland: Springer.
Type Logical Grammar: Categorial Logic of Signs.G. V. Morrill - 2012 - Dordrecht, Netherland: Springer Verlag.
Infinitary action logic with exponentiation.Stepan L. Kuznetsov & Stanislav O. Speranski - 2022 - Annals of Pure and Applied Logic 173 (2):103057.
Context Update for Lambdas and Vectors.Reinhard Muskens & Mehrnoosh Sadrzadeh - 2016 - In Maxime Amblard, Philippe de Groote, Sylvain Pogodalla & Christian Rétoré, Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016). Berlin, Germany: Springer. pp. 247--254.

View all 21 citations / Add more citations

References found in this work

The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.
The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars.Wojcßch Buszkowski - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (24):369-384.

Add more references