Emil Leon Post
Emil Leon Post  

Born  February 11, 1897 Augustów, Suwałki Governorate, Russian Empire (now Poland) 
Died  April 21, 1954 New York City, U.S. 
(aged 57)
Alma mater 
City College of New York (B.S., Mathematics, 1917) Columbia University^{[1]} 
Known for 
Formulation 1, Post correspondence problem, completenessproof of Principia's propositional calculus 
Scientific career  
Fields  Mathematics 
Thesis  Introduction to a General Theory of Elementary Propositions (1920) 
Doctoral advisor  Cassius Jackson Keyser 
Emil Leon Post (February 11, 1897 – April 21, 1954) was an American mathematician and logician. He is best known for his work in the field that eventually became known as computability theory.
Contents
Life
Post was born in Augustów, Suwałki Governorate, Russian Empire (now Poland) into a PolishJewish family that immigrated to New York City in May 1904. His parents were Arnold and Pearl Post.^{[2]}
Post had been interested in astronomy, but at the age of twelve lost his left arm in a car accident. This loss was a significant obstacle to being a professional astronomer. He decided to pursue mathematics, rather than astronomy.^{[3]}
Post attended the Townsend Harris High School and continued on to graduate from City College of New York in 1917 with a B.S. in Mathematics.^{[1]}
After completing his Ph.D. in mathematics at Columbia University, supervised by Cassius Jackson Keyser, he did a postdoctorate at Princeton University in the 1920–1921 academic year. Post then became a high school mathematics teacher in New York City.
Post married Gertrude Singer in 1929, with whom he had a daughter, Phyllis Goodman. Post spent at most three hours a day on research on the advice of his doctor in order to avoid manic attacks, which he had been experiencing since his year at Princeton.^{[4]}
In 1936, he was appointed to the mathematics department at the City College of New York. He died in 1954 of a heart attack following electroshock treatment for depression;^{[4]}^{[5]} he was 57.
Early work
In his doctoral thesis, later shortened and published as "Introduction to a General Theory of Elementary Propositions" (1921), Post proved, among other things, that the propositional calculus of Principia Mathematica was complete: all tautologies are theorems, given the Principia axioms and the rules of substitution and modus ponens. Post also devised truth tables independently of Wittgenstein and C.S. Peirce and put them to good mathematical use. Jean Van Heijenoort's wellknown source book on mathematical logic (1966) reprinted Post's classic article setting out these results.
While at Princeton, Post came very close to discovering the incompleteness of Principia Mathematica, which Kurt Gödel proved in 1931. Post initially failed to publish his ideas as he believed he needed a 'complete analysis' for them to be accepted.^{[2]}
Recursion theory
In 1936, Post developed, independently of Alan Turing, a mathematical model of computation that was essentially equivalent to the Turing machine model. Intending this as the first of a series of models of equivalent power but increasing complexity, he titled his paper Formulation 1. This model is sometimes called "Post's machine" or a Post–Turing machine, but is not to be confused with Post's tag machines or other special kinds of Post canonical system, a computational model using string rewriting and developed by Post in the 1920s but first published in 1943. Post's rewrite technique is now ubiquitous in programming language specification and design, and so with Church's lambdacalculus is a salient influence of classical modern logic on practical computing. Post devised a method of 'auxiliary symbols' by which he could canonically represent any Postgenerative language, and indeed any computable function or set at all.
The unsolvability of his Post correspondence problem turned out to be exactly what was needed to obtain unsolvability results in the theory of formal languages.
In an influential address to the American Mathematical Society in 1944, he raised the question of the existence of an uncomputable recursively enumerable set whose Turing degree is less than that of the halting problem. This question, which became known as Post's problem, stimulated much research. It was solved in the affirmative in the 1950s by the introduction of the powerful priority method in recursion theory.
Polyadic groups
Post made a fundamental and stillinfluential contribution to the theory of polyadic, or nary, groups in a long paper published in 1940. His major theorem showed that a polyadic group is the iterated multiplication of elements of a normal subgroup of a group, such that the quotient group is cyclic of order n − 1. He also demonstrated that a polyadic group operation on a set can be expressed in terms of a group operation on the same set. The paper contains many other important results.
Selected papers
 Post, Emil Leon (1921). "Introduction to a General Theory of Elementary Propositions". American Journal of Mathematics. 43: 163–185. doi:10.2307/2370324.
 Post, Emil Leon (1936). "Finite Combinatory Processes – Formulation 1". Journal of Symbolic Logic. 1: 103–105. doi:10.2307/2269031.
 Post, Emil Leon (1940). "Polyadic groups". Transactions of the American Mathematical Society. 48: 208–350. doi:10.2307/1990085.
 Post, Emil Leon (1943). "Formal Reductions of the General Combinatorial Decision Problem". American Journal of Mathematics. 65: 197–215. doi:10.2307/2371809.
 Post, Emil Leon (1944). "Recursively enumerable sets of positive integers and their decision problems". Bulletin of the American Mathematical Society. 50: 284–316. doi:10.1090/s000299041944081111. Introduces the important concept of manyone reduction.
See also
 Arithmetical hierarchy
 Functional completeness
 List of multiple discoveries
 List of pioneers in computer science
 Post's inversion formula
 Post's lattice
 Post's theorem
Notes
 ^ ^{a} ^{b} Urquhart (2008)
 ^ ^{a} ^{b} O'Connor, John J.; Robertson, Edmund F., "Emil Leon Post", MacTutor History of Mathematics archive, University of St Andrews.
 ^ Urquhart (2008), p. 429.
 ^ ^{a} ^{b} Urquhart (2008), p. 430.
 ^ Baaz, Matthias, ed. (2011). Kurt Gödel and the Foundations of Mathematics: Horizons of Truth (1st ed.). Cambridge University Press. ISBN 9781139498432.
References
 Urquhart, Alasdair (2008). "Emil Post" (PDF). In Gabbay, Dov M.; Woods, John Woods. Logic from Russell to Church. Handbook of the History of Logic. 5. Elsevier BV.
Further reading

Anshel, Iris Lee; Anshel, Michael (November 1993). "From the Post–Markov Theorem Through Decision Problems to PublicKey Cryptography". The American Mathematical Monthly. Mathematical Association of America. 100 (9): 835–844. JSTOR 2324657. doi:10.2307/2324657.
 Dedicated to Emil Post and contains special material on Post. This includes "Post's Relation to the Cryptology and Cryptographists of his Era: ... Steven Brams, the noted game theorist and political scientist, has remarked to us that the life and legacy of Emil Post represents one aspect of New York intellectual life during the first half of the twentieth century that is very much in need of deeper exploration. The authors hope that this paper serves to further this pursuit". (pp. 842–843)

Davis, Martin, ed. (1993). The Undecidable. Dover. pp. 288–406. ISBN 0486432289.
 Reprints several papers by Post.

Davis, Martin (1994). "Emil L. Post: His Life and Work". Solvability, Provability, Definability: The Collected Works of Emil L. Post. Birkhäuser. pp. xi—xxviii.
 A biographical essay.

Jackson, Allyn (May 2008). "An interview with Martin Davis". Notices of the AMS. 55 (5): 560–571.
 Much material on Emil Post from his firsthand recollections.
External links
 Emil Leon Post Papers 19271991, American Philosophical Society, Philadelphia, Pennsylvania.