Skip to main content
SpringerLink
Log in

Extending Free Pregroups with Lower Bounds

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

In this paper, we propose an extension of free pregroups with lower bounds on sets of pregroup elements. Pregroup grammars based on such pregroups provide a kind of an algebraic counterpart to universal quantification over type-variables. In particular, we show how our pregroup extensions can be used for pregroup grammars expressing natural-language coordination and extraction.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Buszkowski, W., ‘Lambek grammars based on pregroups’, in P. De Groote, G. Morrill, and C. Retorè, (eds.), Logical Aspects of Computational Linguistics, vol. 2099 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 2001, pp. 95–109.

  2. Buszkowski, W., ‘Pregroups: models and grammars’, in H. de Swart, (ed.), Relational Methods in Computer Science, vol. 2561 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 2002, pp. 35–49.

  3. Emms, M., ‘An undecidability result for polymorphic Lambek calculus’, https://www.cs.tcd.ie/Martin.Emms/Papers/papers.html. Presented at the 10th Amsterdam Colloquium, 1995.

  4. Francez N., Kaminski M.: ‘Commutation-extended pregroup grammars and mildly context-sensitive languages’. Studia Logica 87, 295–321 (2007)

    Article  Google Scholar 

  5. Kościelski A., Pacholski L.: ‘Complexity of Makanin’s algorithm’. Journal of the ACM 43, 670–684 (1995)

    Article  Google Scholar 

  6. Lambek, J., ‘Type grammars revisited’, in A. Lecomte, F. Lamarche, and G. Perrier, (eds.), Logical Aspects of Computational Linguistics, vol. 1582 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 1999, pp. 1–27.

  7. Makanin G.S.: ‘Equations in a free group’. Mathematics of the USSR-Izvestiya 21, 483–546 (1983)

    Article  Google Scholar 

  8. Makanin G.S.: ‘Decidability of the universal and positive theories of a free group’. Mathematics of the USSR-Izvestiya 25, 75–88 (1985)

    Article  Google Scholar 

  9. Moortgat, M., ‘Categorial type logics’, in J. van Benthem, and A. ter Meulen, (eds.), Handbook of Logic and Language, North Holland, 1997, pp. 93–178.

  10. Sadrzadeh, M., ‘Pregroup analysis of Persian sentences’, in C. Casadio, and J. Lambek, (eds.), Computational algebraic approaches to natural language, Polimetrica, Milano, Italy, 2008, pp. 121–144.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion – Israel Institute of Technology, Haifa, 32000, Israel

    Tamar Aizikowitz, Nissim Francez, Daniel Genkin & Michael Kaminski

Authors
  1. Tamar Aizikowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nissim Francez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Genkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Kaminski.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aizikowitz, T., Francez, N., Genkin, D. et al. Extending Free Pregroups with Lower Bounds. Stud Logica 95, 417–441 (2010). https://doi.org/10.1007/s11225-010-9264-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-010-9264-4

Keywords

Search

Navigation