Lambek

Some articles on lambek:

Lambek–Moser Theorem - Universality
... The Lambek–Moser theorem is universal, in the sense that it can explain any partition of the integers into two infinite parts ... this partition may be derived using the Lambek–Moser theorem define ƒ(n) = sn − n and ƒ*(n) = tn − n ... pair, and the partition generated via the Lambek–Moser theorem from this pair is just the partition of the positive integers into even and odd numbers ...
Joachim Lambek - Selected Works - Articles
... Lambek, Joachim Moser, L ... ISSN 0002-9890, JSTOR 2308078, MR 0062777 Lambek, J. 154–170, doi10.2307/2310058, ISSN 0002-9890, JSTOR 1480361 Lambek, Joachim (1972), "Bicommutators of nice injectives", Journal of Algebra 21 60–73, doi10.1016/0021-8693(72)90034-8 ...
Historical Development of The Register Machine Model - Lambek (1961) Atomizes Melzak's Model Into The Minsky (1961) Model: INC and DEC-with-test
... Lambek (1961) took Melzak's ternary model and atomized it down to the two unary instructions—X+, X- if possible else jump—exactly the same two ... However, like the Minsky (1961) model, the Lambek model does execute its instructions in a default-sequential manner—both X+ and X- carry the identifier of the ...
Lambek–Moser Theorem
... In combinatorial number theory, the Lambek–Moser theorem is a generalization of Beatty's theorem that defines a partition of the positive integers into two subsets from any monotonic integer-valued function ... The theorem was discovered by Leo Moser and Joachim Lambek ...
Joachim Lambek - Scholarly Work
... Lambek supervised 16 doctoral students, and had 51 doctoral descendants ... One of his earliest papers, (Lambek Moser 1954) proved the Lambek-Moser theorem about integer sequences ... his earliest work in this field were probably (Lambek 1958) and (Lambek 1979) ...