[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.

[4] 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.

He died in April 1954 of a heart attack following electroshock treatment for depression, [5][6] less than two months before the death of Alan Turing.

Jean van Heijenoort's well-known source book on mathematical logic (1966) reprinted Post's classic 1921 article setting out these results.

Post's rewrite technique is now ubiquitous in programming language specification and design, and so with Church's lambda calculus is a salient influence of classical modern logic on practical computing.

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.

Post made a fundamental and still influential contribution to the theory of polyadic, or n-ary, groups in a long paper published in 1940.