Skip Navigation



Logic Journal of IGPL Advance Access published online on September 9, 2009
Logic Journal of IGPL, doi:10.1093/jigpal/jzp048
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zielonka, W.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

On the directional Lambek calculus

Wojciech Zielonka

University of Warmia and Mazury, Faculty of Mathematics and Computer Science, Zolnierska 14a, 10-561 Olsztyn, Poland.
E-mail: zielonka{at}uwm.edu.pl

The article presents a calculus of syntactic types which differs from the calculi L and NL of J. Lambek in that, in its Gentzen-like form, sequent antecedents are neither strings (as in L) nor phrase structures (as in NL) but functor-argument structures. The product-free part of the calculus is shown to be equivalent to the system AB due to Ajdukiewicz and Bar-Hillel. However, if the empty sequent antecedent is admitted, the resulting product-free calculus is not finitely cut-rule axiomatizable.

Key Words: Lambek calculus • Gentzen formalism • axiomatization



References

    [1]  Buszkowski W. Typed functorial languages, Bulletin of the Polish Academy of Sciences: Mathematics (1986) 34:507–516.

    [2]  Buszkowski W. Completeness results for Lambek Syntactic Calculus, Zeitschrift füur Mathematische Logik und Grundlagen der Mathematik (1986) 32:13–28.[CrossRef]

    [3]  Buszkowski W. The logic of types. In: Initiatives in Logic—Srzednicki J, ed. (1987) Amsterdam: M. Nijhoff. 180–206.

    [4]  Buszkowski W. personal communication.

    [5]  Kandulski M. The non-associative Lambek calculus. In: Categorial Grammars—Buszkowski W, Marciszewski W, van Benthem J, eds. (1988) Amsterdam: Benjamins. 141–151.

    [6]  Kandulski M. The equivalence of non-associative Lambek categorial grammars and context-free grammars, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (1988) 34:41–52.[CrossRef][Web of Science]

    [7]  Lambek J. The mathematics of sentence structure, American Mathematical Monthly (1958) 65:154–170.[CrossRef]

    [8]  Lambek J. On the calculus of syntactic types. In: Structure of Language and Its Mathematical Aspects—Jakobson R, ed. (1961) Providence: AMS. 166–178.

    [9]  Moortgat M. Multimodal linguistic inference, Journal of Logic, Language, and Information (1996) 5:349–385.[CrossRef]

    [10]  Moortgat M, Morrill G. Heads and phrases. Type calculus for dependency and constituent structure. Manuscript, OTS Utrecht (1991).

    [11]  Steedman M. Combinators and grammars. In: Categorial Grammars and Natural Language Structures—Oehrle RT, Bach E, Wheeler D, eds. (1988) Dordrecht: Reidel. 417–442.

    [12]  Zielonka W. Cut-rule axiomatization of product-free Lambek calculus with the empty string, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (1988) 34:135–142.[CrossRef][Web of Science]

    [13]  Zielonka W. Interdefinability of Lambekian fuctors, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (1992) 38:501–507.[CrossRef][Web of Science]

    [14]  Zielonka W. Cut-rule axiomatization of the syntactic calculus NL0, Journal of Logic, Language and Information (2000) 9:339–352.[CrossRef]

    [15]  Zielonka W. Cut-rule axiomatization of the syntactic calculus L0, Journal of Logic, Language and Information (2001) 10:233–236.[CrossRef]

    [16]  Zielonka W. On reduction systems equivalent to the Lambek calculus with the empty string, Studia Logica (2002) 71:31–46.[CrossRef]

    [17]  Zielonka W. On reduction systems equivalent to the non-associative Lambek calculus with the empty string, Journal of Logic and Computation (2007) 17:299–310.[Abstract/Free Full Text]


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zielonka, W.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?