Skip to main content
SpringerLink
Log in

Iterated Galois Connections in Arithmetic and Linguistics

  • Chapter
Galois Connections and Applications

Part of the book series: Mathematics and Its Applications ((MAIA,volume 565))

Abstract

Galois connections may be viewed as pairs of adjoint functors, specialized from categories to partially ordered sets. We study situations that permit iterations of such adjoints. While their occurrence in elementary number theory is a curiosity, they play a crucial role in a new algebraic approach to sentence structure in natural languages.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Referenzen

  1. J. Lambek and L. Moser, Inverse and complementary sequences of natural numbers, Amer. Math. Monthly 61 (1954), 454–458.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Lambek, Some Galois connections in elementary number theory, J. Number Theory 47 (1994), 371–377.

    Article  MathSciNet  MATH  Google Scholar 

  3. J. Lambek, Type grammar revisited, in: A. Lecomte et al. (eds), Logical aspects of computational linguistics, Springer LNAI 1582 (1999), 1–27.

    Chapter  Google Scholar 

  4. J. Lambek, Pregroups: a new algebraic approach to sentence structure, in: C. Martin-Vide et al. (eds), Recent topics in mathematical and computational linguistics, Editura Academici Române, Bucharest 2000.

    Google Scholar 

  5. J. Lambek, Type grammar meets German word order, Theoretical Linguistics 26 (2000), 19–30.

    Article  Google Scholar 

  6. D. Bargelli and J. Lambek, An algebraic approach to French sentence structure, in: Groote et al. (eds.), Logical aspects of computational linguistics, Springer LNAI 12099 (2003), 62–78.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. McGill University, Montreal, Canada

    J. Lambek

Authors
  1. J. Lambek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Potsdam, Potsdam, Germany

    K. Denecke

  2. University of Hannover, Hannover, Germany

    M. Erné

  3. University of Lethbridge, Lethbridge, Canada

    S. L. Wismath

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Lambek, J. (2004). Iterated Galois Connections in Arithmetic and Linguistics. In: Denecke, K., Erné, M., Wismath, S.L. (eds) Galois Connections and Applications. Mathematics and Its Applications, vol 565. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-1898-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-1898-5_11

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-6540-7

  • Online ISBN: 978-1-4020-1898-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation