Joachim Lambek

Joachim Lambek (born 5 Dec 1922) is Peter Redpath Emeritus Professor of Pure Mathematics at McGill University, where he earned his Ph.D. degree in 1950 with Hans Julius Zassenhaus as advisor. He is called Jim by his friends.

Scholarly work

Lambek supervised 16 doctoral students, and had 51 doctoral descendants. He has over 100 publications listed in the Mathematical Reviews, including 6 books. His earlier work was mostly in module theory, especially torsion theories, non-commutative localization, and injective modules. One of his earliest papers, harv|Lambek|Moser|1954 proved the Lambek-Moser theorem about integer sequences. His more recent work is in pregroups and formal languages; his earliest work in this field were probably harv|Lambek|1958 and harv|Lambek|1979. He is noted, among other things, for the Lambek calculus, an effort to capture mathematical aspects of natural language syntax in logical form and a work that has been very influential in computational linguistics. He is currently working on pregroup grammar.

Selected works

Books

Articles

References

* | year=2000

External links

*
* [http://www.math.mcgill.ca/people/lambek Faculty profile of Joachim Lambek] at McGill University
* [http://www.math.mcgill.ca/triples/lambek97/Lambek.biography.html An appreciation of Jim Lambek at McGill] by Michael Barr (a biographical talk given on the occasion of his 75th birthday)
* [http://www.math.mcgill.ca/triples/Lambfest02/ Lambek festival] (80th annivarsary)

Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

Lambek-Moser theorem — In combinatorics, Lambek Moser theorem applies to an increasing arithmetic function with non negative integral value f ( n ), Let :f^* be an integral valued function such that :f(f^*(n)) < n le f(f^*(n)+1).Then :f^{**} = f.Let :F(n) = f(n)+n,… … Wikipedia
Register machine — In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. Contents 1 Overview 2 Formal definition 3 … Wikipedia
Counter machine models — This page supplements counter machine. Although some authors use the name register machine synonymously with counter machine , this article will give details and examples of only of the most primitive species the counter machine of the genus… … Wikipedia
Counter machine — A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded… … Wikipedia
Noncommutative logic — is an extension of linear logic which combines the commutative connectives of linear logic with the noncommutative multiplicative connectives of the Lambek calculus (see External links below). Its sequent calculus relies on the structure of order … Wikipedia
Injective module — In mathematics, especially in the area of abstract algebra known as module theory, an injective module is a module Q that shares certain desirable properties with the Z module Q of all rational numbers. Specifically, if Q is a submodule of some… … Wikipedia
Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… … Wikipedia
Random access machine — In computer science, random access machine (RAM) is an abstract machine in the general class of register machines. The RAM is very similar to the counter machine but with the added capability of indirect addressing of its registers. Like the… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence … Wikipédia en Français

Academic Dictionaries and Encyclopedias

Joachim Lambek

Look at other dictionaries:

Share the article and excerpts

Academic Dictionaries and Encyclopedias

Wikipedia

Joachim Lambek

Look at other dictionaries:

Share the article and excerpts

Direct link