HOME

TheInfoList



OR:

Moses Ilyich Schönfinkel (; 29 September 1888 – ) was a logician and
mathematician A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, mathematical structure, structure, space, Mathematica ...
, known for the invention of
combinatory logic Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell Curry, and has more recently been used in computer science as a theoretical model of com ...
.


Life

Moses Schönfinkel was born on in Ekaterinoslav, Russian Empire (now Dnipro, Ukraine). He was born to a
Jewish Jews (, , ), or the Jewish people, are an ethnoreligious group and nation, originating from the Israelites of History of ancient Israel and Judah, ancient Israel and Judah. They also traditionally adhere to Judaism. Jewish ethnicity, rel ...
family. His father was Ilya Girshevich Schönfinkel, a merchant of first guild, who was in а grocery store trade, and his mother, Maria “Masha” Gertsovna Schönfinkel (née Lurie) came from a prominent Lurie family. Moses had siblings named Deborah, Natan, Israel and Grigoriy. Schönfinkel attended the Novorossiysk University of
Odessa ODESSA is an American codename (from the German language, German: ''Organisation der ehemaligen SS-Angehörigen'', meaning: Organization of Former SS Members) coined in 1946 to cover Ratlines (World War II aftermath), Nazi underground escape-pl ...
, studying
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
under Samuil Osipovich Shatunovskii (1859–1929), who worked in
geometry Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician w ...
and the
foundations of mathematics Foundations of mathematics are the mathematical logic, logical and mathematics, mathematical framework that allows the development of mathematics without generating consistency, self-contradictory theories, and to have reliable concepts of theo ...
. From 1914 to 1924, Schönfinkel was a member of
David Hilbert David Hilbert (; ; 23 January 1862 – 14 February 1943) was a German mathematician and philosopher of mathematics and one of the most influential mathematicians of his time. Hilbert discovered and developed a broad range of fundamental idea ...
's group at the
University of Göttingen The University of Göttingen, officially the Georg August University of Göttingen (, commonly referred to as Georgia Augusta), is a Public university, public research university in the city of Göttingen, Lower Saxony, Germany. Founded in 1734 ...
in
Germany Germany, officially the Federal Republic of Germany, is a country in Central Europe. It lies between the Baltic Sea and the North Sea to the north and the Alps to the south. Its sixteen States of Germany, constituent states have a total popu ...
. On 7 December 1920 he delivered a talk entitled ''Elemente der Logik'' ("Elements of Logic") to the group where he outlined the concept of
combinatory logic Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell Curry, and has more recently been used in computer science as a theoretical model of com ...
.
Heinrich Behmann Heinrich Behmann (; 10 January 1891, Bremen-Aumund – 3 February 1970, Bremen-Aumund) was a German mathematician. He performed research in the field of set theory and predicate logic. Behmann studied mathematics in Tübingen, Leipzig and Gö ...
, a member of Hilbert's group, later revised the text and published it in 1924. In 1928, Schönfinkel had one other paper published, on special cases of the decision problem (''
Entscheidungsproblem In mathematics and computer science, the ; ) is a challenge posed by David Hilbert and Wilhelm Ackermann in 1928. It asks for an algorithm that considers an inputted statement and answers "yes" or "no" according to whether it is universally valid ...
''), that was prepared by
Paul Bernays Paul Isaac Bernays ( ; ; 17 October 1888 – 18 September 1977) was a Swiss mathematician who made significant contributions to mathematical logic, axiomatic set theory, and the philosophy of mathematics. He was an assistant and close collaborator ...
. After he left Göttingen, Schönfinkel returned to Moscow. By 1927 he was reported to be mentally ill and in a sanatorium. His later life was spent in poverty, and he died in Moscow some time in . His papers were burned by his neighbors for heating.


Work

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, S and a combinator for a universally quantified nand function which he called U. Schönfinkel stated that the system could be reduced to just K, S, and U (a colleague stated that U could be factored to the end of any expression and thus not always explicitly written) and outlined a proof that a version of this system had the same power as
predicate logic First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables ove ...
. His paper also showed that functions of two or more arguments could be replaced by functions taking a single argument. This replacement mechanism simplifies work in both combinatory logic and
lambda calculus In mathematical logic, the lambda calculus (also written as ''λ''-calculus) is a formal system for expressing computability, computation based on function Abstraction (computer science), abstraction and function application, application using var ...
and would later be called
currying In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions, each taking a single argument. In the prototypical example, one begins with a functi ...
, after Haskell Curry. While Curry attributed the concept to Schönfinkel, it had already been used by Frege (an example of Stigler's law). The complete known published output of Schönfinkel consists of just two papers: his 1924 ''On the Building Blocks of Mathematical Logic'', and another, 31-page paper written in 1927 and published 1928, coauthored with Paul Bernays, entitled ''Zum Entscheidungsproblem der mathematischen Logik'' (''On the Decision Problem of Mathematical Logic'').


Publications

* * *


See also

*
Combinatory logic Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell Curry, and has more recently been used in computer science as a theoretical model of com ...
* Bernays–Schönfinkel class *
Currying In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions, each taking a single argument. In the prototypical example, one begins with a functi ...


References


Further reading

* * * * * * (Reprinted lecture notes from 1967.) * (eBook: )


External links

* * * * {{DEFAULTSORT:Schoenfinkel, Moses 1888 births 1942 deaths Mathematicians from the Russian Empire Scientists from Dnipro Odesa University alumni Logicians from the Russian Empire Ukrainian Jews Russian people of Ukrainian-Jewish descent Soviet philosophers Jewish philosophers Soviet logicians Expatriates from the Russian Empire in Germany Russian scientists