Skip to main content
Log in

The Lambek calculus enriched with additional connectives

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Benthem, J.van, 1989, “Semantic type change and syntactic recognition”, in Properties, Types and Meaning, Volume I: Foundational Issues, G. Chierchia, B. H. Partee, and R. Turner, eds., Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Benthem, J.van 1991, Language in Action: Categories, Lambdas and Dynamic Logic, Amsterdam: North Holland.

    Google Scholar 

  • Buszkowski, W., 1982, “Compatibility of a categorial grammar with an associated category system”, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 28, 229–238.

    Google Scholar 

  • Buszkowski, W., 1985, “The equivalence of unidirectional Lambek categorial grammars and context-free grammars”, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 31, 369–384.

    Google Scholar 

  • Buszkowski, W., 1988, “Generative power of categorial grammars”, in Categorial Grammars and Natural Language Structures, R. Oehrle, E. Bach, and D. Wheeler, eds., Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Buszkowski, W., 1991, “On generative capacity of the Lambek calculus”, in Logics in AI, Lecture Notes in Artificial Intelligence 478, J. van Eijk, ed., Berlin: Springer.

    Google Scholar 

  • Curry, H. B., 1952, “The permutability of rules in the classical inferential calculus”, Journal of Symbolic Logic 17, 245–248.

    Google Scholar 

  • Hopcroft, J. E. and J. D., Ullman, 1979, Introduction to Automata Theory, Languages, and Computation, Reading, MA: Addison-Wesley.

    Google Scholar 

  • Kleene, S. C., 1952, “Permutability of inferences in Gentzen's calculi LK and LJ”, in Two Papers on the Predicate Calculus, Memoirs of the American Mathematical Society 10.

  • Lambek, J., 1958, “The mathematics of sentence structure”, American Mathematical Monthly 65, 154–170. (Also in Categorial Grammars, W. Buszkowski, W. Marciszewski, and J. van Benthem, eds., 1988, Amsterdam: John Benjamins.)

    Google Scholar 

  • Lambek, J., 1961, “On the calculus of syntactic types”, in Structure of Language and its Mathematical Aspects, R. Jakobson, ed., American Mathematical Society.

  • Pâun, G., 1980, “A note on the intersection of context-free languages”, Fundamenta Informaticae 3, 135–139.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

I would like to thank Professor Johan van Benthem for much encouragement and a number of helpful suggestions. Thanks are also due to Dirk Roorda, who commented on an earlier draft of the paper, and to my advisor Professor Stanley Peters.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kanazawa, M. The Lambek calculus enriched with additional connectives. J Logic Lang Inf 1, 141–171 (1992). https://doi.org/10.1007/BF00171695

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00171695

Key words

Navigation