Abstract
This paper studies the relation between some extensions of the non-associative Lambek Calculus NL and their interpretation in tree models (free groupoids). We give various examples of sequents that are valid in tree models, but not derivable in NL. We argue why tree models may not be axiomatizable if we add finitely many derivation rules to NL, and proceed to consider labeled calculi instead.
We define two labeled categorial calculi, and prove soundness and completeness for interpretations that are ‘almost’ the intended one, namely for tree models where some branches of some trees may be resp. all branches of all trees must be infinitely extending. Extrapolating from the experiences in our quite simple systems, we briefly discuss some problems involved with the introduction of labels in categorial grammar, and argue that many of the basic questions are not yet understood.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Van Benthem, J., 1991, Language in Action, Amsterdam: North-Holland.
Buszkowki, W., 1986, “Completeness results for Lambek syntactic calculus,” Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 32, 13–28.
Chau, H.F., 1993, “A proof search system for a modal substructural logic based on labeled Deductive Systems,” pp. 64–75 in Logic Programming and Automated Reasoning (Proceedings LPAR'93), A. Voronkov, ed., Berlin: Springer-Verlag (LNCS 698).
Došen, K. and Schröder-Heister, eds., 1993, Substructural Logics, Oxford: Oxford University Press.
Došen, K., 1992, “A brief survey of frames for the Lambek calculus,” Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 38, 179–187.
Gabbay, D.M., to appear, Labeled Deductive Systems — Part I, Oxford: Oxford University Press.
Goranko, V. and Passy, S., 1992, “Using the universal modality: gains and questions,” Journal of Logic and Computation 2, 5–30.
Hepple, M., 1993, “Labeled deduction and discontinuous constituency,” manuscript, 41 pp., Institute for Research in Cognitive Science, University of Pennsylvania.
Kandulski, M., 1988, “The non-associative Lambek calculus,” pp. 141–151 in Categorial Grammar, W. Buszkowski et al., eds., Amsterdam/Philadelphia: John Benjamin Publ. Co.
Kurtonina, N., to appear, “The Lambek calculus: relational semantics and the method of labeling,” Studia Logica.
Lambek, J., 1958, “The mathematics of sentence structure,” American Mathematical Monthly 65, 154–484.
Lambek, J., 1961, “On the calculus of syntactic types,” pp. 166–178 in Structure of Language and Its Mathematical Aspects, J. Jakobson, ed., Providence: American Mathematical Society.
Moortgat, M., 1988, Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus, Dordrecht: Foris.
Moortgat, M., to appear, “Generalized quantifiers and discontinuous type constructors,” OTS Working Papers OTS-WP-CL-92–001, Research Institute for Language and Speech, Utrecht University, 1992, in Discontinuous Constituency, W. Sijtsma and A. van Horkc, eds., Berlin: Mouton de Gruyter.
Moortgat, M., 1992, “Labeled deductive systems for categorial theorem proving,” pp. 403–424 in Proceedings of the 8th Amsterdam Colloquium, P. Dekker and M. Stokhof, eds., Amsterdam.
Moortgat, M. and Morrill, G., to appear, “Heads and phrases. Type calculus for dependency and constituent structure,” manuscript, OTS, Utrecht, 1992.
Moortgat, M. and Oehrle, R. T., 1994, “Adjacency and dependency,” pp. 447–466 in Proceedings of the 9th Amesterdam Colloquium, P. Dekker and M. Stokhof, eds., Amsterdam.
Morrill, G. and Solias, T., 1993, “Tuples, discontinuity, and gapping in categorial grammar,” pp. 287–296 in Proceedings of the European Association for Computational Linguistics 1993.
Morrill, G., 1994, Type Logical Grammar, Dordrecht: Kluwer Academic Publishers.
Oehrle, R.T., 1988, “Multidimensional compositional functions as a basis for grammatical analysis,” pp. 349–390 in Categorial Grammars and Natural Language Structures, R.T. Oehrel et al., eds., Dordrecht: Reidel.
Pentus, M., 1994, “Language completeness of the Lambek calculus”, pp. 487–496 in Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science.
Roorda, D., 1992, “Lambek calculus and Boolean connectives: on the road,” OTS Working Papers OTS-WP-CL-92-004, Research Institute for Language and Speech, Utrecht University.
Roorda, D., 1993, “Reasoning with ⊙,/,\, ∧, ∨ in semigroups: sequent systems,” manuscript, 21 pp., Vakgroep Informatica, University of Groningen.
Versmissen, K., 1991, “Discontinuous type constructors in categorial grammar,” MSc Thesis, Department of Computing Science, Utrecht University.
Zielonka, W., 1992, “Interdefinability of Lambekian functors,” Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 38, 501–507.
Zielonka, W., personal communication.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Venema, Y. Tree models and (labeled) categorial grammar. J Logic Lang Inf 5, 253–277 (1996). https://doi.org/10.1007/BF00159341
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00159341