Emil Post Jr.

Emil Post Jr. was an American logician and mathematician known for foundational work in mathematical logic, recursion theory, and decision problems. He produced influential results on formal systems, published pioneering papers on undecidability, and formulated the Post correspondence problem that became central in computability theory. His work influenced contemporaries and successors across Princeton University, Harvard University, Institute for Advanced Study, and later generations in computer science and theoretical computer science.

Early life and education

Born in New York City, Post attended the City College of New York before pursuing graduate study at Columbia University under the supervision of Cassius Jackson Keyser. He studied alongside contemporaries connected to the New York School of mathematics and interacted with figures associated with Princeton University and the Institute for Advanced Study. His doctoral work and early publications engaged with problems related to the decision problem and the formal investigations pioneered by David Hilbert, Kurt Gödel, and Alonzo Church.

Academic career and positions

Post held positions and visiting affiliations at institutions including Fordham University, the Cornell University Mathematics Department, and the Institute for Advanced Study. He corresponded and collaborated with researchers at Harvard University, Columbia University, and the University of Chicago while contributing to seminars connected to Princeton University and Yale University. His professional network included conversations with Alonzo Church, Alan Turing, Kurt Gödel, Emil Artin, and John von Neumann, and he engaged with organizations such as the American Mathematical Society and the Association for Symbolic Logic.

Contributions to logic and recursion theory

Post introduced structural ideas about production systems and formal grammars that anticipated concepts in formal language theory and influenced developments in lambda calculus, Turing machines, and recursive functions. He formulated the notion of recursively enumerable sets and explored degrees of unsolvability, informing later work by Stephen Kleene, Alonzo Church, and Alan Turing. Post's analyses addressed completeness and decidability issues connected to the Entscheidungsproblem and related results by Kurt Gödel and Emil Leon Post. He developed combinatorial techniques that resonated with research at Bell Labs, IBM, and in emergent computer science departments such as those at Massachusetts Institute of Technology and Stanford University.

Post correspondence problem

Post formulated the Post correspondence problem (PCP), an undecidability result showing that a simple matching problem for pairs of words over a finite alphabet is algorithmically unsolvable. The PCP connected to seminal undecidability proofs by Alan Turing, Alonzo Church, and Kurt Gödel, and it provided tools used in reductions involving semi-Thue systems, tag systems, and proof techniques later applied in automata theory and formal language theory. The PCP influenced work by researchers at Princeton University, University of California, Berkeley, and University of Warwick, and it became a standard example in texts by Michael Sipser, Hopcroft and Ullman, and John E. Hopcroft addressing the limits of computation.

Later work and legacy

In later years Post continued to refine ideas on simple and creative sets, productive functions, and degrees of unsolvability, shaping directions pursued by Richard M. Karp, Emil Post (namesake conflict), Marvin Minsky, and Noam Chomsky. His legacy extends through concepts taught in programs at Massachusetts Institute of Technology, Carnegie Mellon University, University of California, Los Angeles, and University College London. Collections of his papers and posthumous studies influenced historiography in works associated with American Mathematical Society, Association for Symbolic Logic, and archives at Columbia University. Post's theorems and problems remain central in curricula and research across logic, computability theory, formal languages, and theoretical computer science.

Category:American logicians Category:Mathematical logicians Category:1897 births Category:1954 deaths