Emil Post

Emil Post
Public domain · source
Name	Emil Post
Birth date	August 11, 1897
Birth place	Augustów, Congress Poland, Russian Empire
Death date	April 21, 1954
Death place	New York City, New York, United States
Fields	Mathematical logic, computability theory, recursion theory
Workplaces	Princeton University, Institute for Advanced Study, City College of New York
Alma mater	Columbia University
Known for	Post correspondence problem, Post canonical systems, work on decidability

Emil Post Emil Leon Post was an American logician and mathematician notable for foundational work in mathematical logic, computability theory, and decision problems. He produced influential results on recursively enumerable sets, formulated canonical systems that anticipated formal language concepts, and posed the Post correspondence problem that became central in undecidability theory. His work influenced figures across logic, computer science, and mathematics.

Early life and education

Born in Augustów in the Suwałki Governorate of the Russian Empire (now Poland), Post emigrated to the United States as a child and grew up in New York City. He attended Stuyvesant High School and later studied at Columbia University, where he completed a Ph.B. and an M.A. before earning a Ph.D. under the supervision network of scholars connected to Columbia University's mathematics faculty. During his formative years he interacted with contemporaries influenced by developments at Hilbert's program debates and the emerging work of David Hilbert, Kurt Gödel, and Alonzo Church.

Academic career and positions

Post held positions at the City College of New York and did substantial research while associated with Princeton University and the Institute for Advanced Study. He worked alongside or in the same intellectual milieu as figures such as Oswald Veblen, John von Neumann, and Alonzo Church. Post’s career included periods of independent research and intermittent teaching, during which he communicated and corresponded with contemporaries like Emil L. Post's peers—figures in mathematical logic circles including Stephen Kleene, Alan Turing, and Hermann Weyl.

Contributions to logic and computability

Post made seminal contributions to notions later formalized in recursion theory and the theory of r.e. sets—a term tied to work by Alonzo Church and Alan Turing. He introduced concepts of productive and creative sets and proved results about degrees of unsolvability that paralleled and complemented results by Stephen Kleene and John Myhill. Post’s analysis of formal systems led to the formulation of Post canonical systems, which anticipated parts of formal language theory developed later by researchers linked to Noam Chomsky and M. A. Harrison. His exploration of decision problems engaged with the same circle of problems addressed by Hilbert's Entscheidungsproblem and the negative solutions from Church and Turing.

Post correspondence problem and decision problems

In 1946 Post introduced the Post correspondence problem (PCP), a simple combinatorial matching problem shown to be undecidable; this result joined other undecidability results such as those by Alan Turing on the halting problem and by Alonzo Church on lambda-definability. PCP became a standard tool in reductions proving undecidability for problems in group theory studied by researchers connected to Max Dehn's traditions, in formal languages and in automata theory investigated by scholars like Michael Rabin and Dana Scott. The PCP’s simplicity made it instrumental in transferring undecidability to decision problems in semigroup theory, tiling problems related to work by Wang, and to complexity analyses pursued later by Richard Karp and Juris Hartmanis.

Later work and influence

Post’s later research continued to probe the structure of recursively enumerable degrees and the limits of mechanization in mathematics; his notions of creative and productive sets influenced subsequent work by Emil Post's successors such as Roger Myhill, Emil L. Post-linked researchers, and Postdoctoral generations including Martin Davis and Hilary Putnam. His ideas fed into the maturation of computer science as an independent discipline at institutions like MIT and Princeton University, and his legacy is evident in the continued study of undecidability, degree theory, and formal systems by scholars like S. Barry Cooper and Hartley Rogers Jr..

Selected publications and legacy

Post’s major papers include his early 1920s and 1930s notes and the 1946 formulation of the correspondence problem, along with influential articles on canonical systems, productive sets, and recursively enumerable sets published in venues frequented by members of the American Mathematical Society and Columbia University circles. His collected works and commentary have been discussed by historians and logicians including Georg Kreisel and Solomon Feferman. Post’s concepts remain central in textbooks and surveys on computability theory, recursion theory, and the theory of formal languages produced by authors such as Hartley Rogers Jr., Alan Turing-era commentators, and modern computer science curricula.

Category:American mathematicians Category:Logicians Category:Computability theorists