Moses Schönfinkel

Moses Ilyich Schönfinkel

Born 4 September 1889
Ekaterinoslav, Russian Empire ((now Dnipropetrovsk, Ukraine))
Died 1942
Moscow, Soviet Union
Citizenship Russian
Nationality Russian
Fields Mathematics
Institutions University of Göttingen
Known for Combinatory logic
Technique for binding arguments

Moses Ilyich Schönfinkel, also known as Moisei Isai'evich Sheinfinkel' (Russian: Моисей Исаевич Шейнфинкель; 4 September 1889 1942), was a Russian logician and mathematician, known for the invention of combinatory logic.


Schönfinkel attended the Novorossiysk University of Odessa, studying mathematics under Samuil Osipovich Shatunovskii (18591929), who worked in geometry and the foundations of mathematics. From 1914 to 1924, Schönfinkel was a member of David Hilbert's group at the University of Göttingen.[1] On 7 December 1920 he delivered a talk to the group where he outlined the concept of combinatory logic. Heinrich Behmann, a member of Hilbert's group, later revised the text and published it in 1924.[2] In 1929, Schönfinkel had one other paper published, on special cases of the decision problem (Entscheidungsproblem), that was prepared by Paul Bernays.[3]

After he left Göttingen, Schönfinkel returned to Moscow. By 1927 he was reported to be mentally ill and in a sanatorium.[2][3] His later life was spent in poverty, and he died in Moscow some time in 1942. His papers were burned by his neighbors for heating.[3]


Schönfinkel developed a formal system that avoided the use of bound variables. His system was essentially equivalent to a combinatory logic based upon the combinators B, C, I, K, and S. Schönfinkel was able to show that the system could be reduced to just K and S and outlined a proof that a version of this system had the same power as predicate logic.[2]

His paper also showed that functions of two or more arguments could be replaced by functions taking a single argument.[4][5][6] This replacement mechanism simplifies work in both combinatory logic and lambda calculus and would later be called currying, after Haskell Curry. While Curry attributed the concept to Schönfinkel, it had already been used by Frege.[7]


See also


Wikimedia Commons has media related to Moses Ilyich Schönfinkel (logician).
  1. Cardone, Felice; Hindley, J. Roger, "History of Lambda-calculus and Combinatory Logic", in Gabbay, Dov M.; Woods, John, Handbook of the History of Logic, 5, Elsevier
  2. 1 2 3 Curry, Haskell (November 1927), Notes on Schönfinkel, 271128A (T271128A), Curry archives.
  3. 1 2 3 Kline, G. L.; Anovskaa, S. A. (1951), "Review of Foundations of mathematics and mathematical logic by S. A. Yanovskaya", Journal of Symbolic Logic, 16 (1): 4648, doi:10.2307/2268665, JSTOR 2268665
  4. Strachey, Christopher (2000). "Fundamental Concepts in Programming Languages". Higher-Order and Symbolic Computation. 13: 11–49. doi:10.1023/A:1010000313106. There is a device originated by Schönfinkel, for reducing operators with several operands to the successive application of single operand operators. (Reprinted lecture notes from 1967.)
  5. Reynolds, John C. (1998). "Definitional Interpreters for Higher-Order Programming Languages". Higher-Order and Symbolic Computation. 11 (4): 374. doi:10.1023/A:1010027404223. In the last line we have used a trick called Currying (after the logician H. Curry) to solve the problem of introducing a binary operation into a language where all functions must accept a single argument. (The referee comments that although "Currying" is tastier, "Schönfinkeling” might be more accurate.)
  6. Kenneth Slonneger and Barry L. Kurtz. Formal Syntax and Semantics of Programming Languages. 1995. p. 144.
  7. Willard Van Orman Quine, introduction to "Bausteine der mathematischen Logik", pp. 305316. Translated by Stefan Bauer-Mengelberg as "On the building blocks of mathematical logic" in Jean van Heijenoort (1967), A Source Book in Mathematical Logic, 18791931. Harvard University Press, pp. 35566.
This article is issued from Wikipedia - version of the 11/15/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.