论文信息 - The Lambek calculus enriched with additional connectives

The Lambek calculus enriched with additional connectives

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.

Makoto Kanazawa

[1] Wojciech Buszkowski,et al. On Generative Capacity of the Lambek Calculus , 1991, JELIA.

[2] Wojciech Buszkowski. The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars , 1985, Math. Log. Q..

[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[4] Johan van Benthem,et al. Semantic Type-Change and Syntactic Recognition , 1989 .

[5] W. Buszkowski. Generative Power of Categorial Grammars , 1988 .

[6] Wojciech Buszkowski. Compatibility of a Categorial Grammar With an Associated Category System , 1982, Math. Log. Q..

[7] J. Lambek. The Mathematics of Sentence Structure , 1958 .

[8] Gheorghe Paun,et al. A note on the intersection of context-free languages , 1980, Fundamenta Informaticae.

[9] Haskell B. Curry,et al. The permutability of rules in the classical inferential calculus , 1952, Journal of Symbolic Logic.