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.
Keywords Lambek calculus  categorial grammar  recognizing power  intersective conjunction  context-free languages
Categories (categorize this paper)
DOI 10.1007/BF00171695
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 60,920
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Mathematics of Sentence Structure.Joachim Lambek - 1968 - Journal of Symbolic Logic 33 (4):627-628.
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

Citations of this work BETA

Parsing/Theorem-Proving for Logical Grammar CatLog3.Glyn Morrill - 2019 - Journal of Logic, Language and Information 28 (2):183-216.
Grammar Logicised: Relativisation.Glyn Morrill - 2017 - Linguistics and Philosophy 40 (2):119-163.

View all 13 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
28 ( #382,613 of 2,439,308 )

Recent downloads (6 months)
1 ( #434,168 of 2,439,308 )

How can I increase my downloads?

Downloads

My notes