Emil Leon Post (/poʊst/; February 11, 1897 – April 21, 1954) was an American mathematician and logician. He is best known for his work in the field that...

6–7 years Emil Post developed his definition of a worker moving from room to room writing and erasing marks per a list of instructions (Post 1936), as...

The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946. Because it is simpler than the halting problem...

theory Post's theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. The statement of Post's theorem...

propositional calculus was proved by Paul Bernays in 1918[citation needed] and Emil Post in 1921, while the completeness of (first order) predicate calculus was...

article. Papers of Gödel, Alonzo Church, Turing, Rosser, Kleene, and Emil Post are included; those cited in the article are listed here by author's name...

functions. 7 October 1936 (1936-10-07): Emil Post's paper "Finite Combinatory Processes. Formulation I" is received. Post adds to his "process" an instruction...

propositional logic (Emil Post 1920) Proof of the semantic completeness of truth-functional propositional logic (Paul Bernays 1918), (Emil Post 1920) Proof of...

A Post–Turing machine is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation...

Noam Chomsky as the term for grammar studied previously by Emil Post and Axel Thue (Post canonical systems). Some authors, however, reserve the term...