Skip Navigation

Journal of Logic and Computation 2004 14(2):205-214; doi:10.1093/logcom/14.2.205
© 2004 by Oxford University Press
This Article
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 Similar articles in ISI Web of Science
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 Kandulski, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Categorial Grammars and Tree Languages

Maciej Kandulski1

1 Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznan, Poland. E-mail: mkandu{at}amu.edu.pl

We consider a representation of the structure of derivations in Ajdukiewicz and Lambek categorial grammars called derived trees. We define derived tree languages of those grammars based on syntactic calculi formalized in Gentzen style and in natural deduction format and examine their relation to the families of local and regular tree languages.

Keywords: Lambek grammar, Adjukiewicz grammar, tree languages, derived trees

Received 26 March 2002.


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




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.