Emil Post
E681008
Emil Post was a pioneering logician and mathematician whose work on recursive functions, production systems, and undecidability helped lay the foundations of modern computability theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Emil Post canonical | 3 |
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
human
ⓘ
logician ⓘ |
| activeInPeriod | 20th century ⓘ |
| birthCountry | Poland NERFINISHED ⓘ |
| birthDate | 1897-02-11 ⓘ |
| birthPlace | Augustów NERFINISHED ⓘ |
| causeOfDeath | heart disease ⓘ |
| citizenship | United States of America ⓘ |
| contributedTo |
classification of degrees of unsolvability
ⓘ
development of recursive function theory ⓘ formalization of production systems ⓘ theory of undecidable problems ⓘ |
| deathDate | 1954-04-21 ⓘ |
| doctoralAdvisor | Cassius Jackson Keyser NERFINISHED ⓘ |
| doctoralThesisTitle | Introduction to a general theory of elementary propositions NERFINISHED ⓘ |
| doctoralThesisYear | 1920 ⓘ |
| educatedAt |
City College of New York
NERFINISHED
ⓘ
Columbia University ⓘ |
| employer | City College of New York NERFINISHED ⓘ |
| familyName | Post NERFINISHED ⓘ |
| fieldOfWork |
computability theory
ⓘ
foundations of mathematics ⓘ mathematical logic ⓘ recursion theory ⓘ |
| givenName | Emil NERFINISHED ⓘ |
| hasNotableConceptNamedAfter |
Post algebra
NERFINISHED
ⓘ
Post hierarchy NERFINISHED ⓘ Post normal form NERFINISHED ⓘ Post set NERFINISHED ⓘ |
| influenced |
automata theory
ⓘ
computability theory ⓘ proof theory ⓘ theory of formal languages ⓘ |
| knownFor |
Post correspondence problem
NERFINISHED
ⓘ
Post normal systems NERFINISHED ⓘ Post production systems ⓘ Post’s theorem NERFINISHED ⓘ early work on completeness and consistency in logic ⓘ independently discovering ideas related to Turing machines ⓘ work on many-valued logic ⓘ work on recursively enumerable sets ⓘ work on undecidability ⓘ |
| laterNationality | American ⓘ |
| name | Emil Leon Post NERFINISHED ⓘ |
| nationalityAtBirth | Polish ⓘ |
| notableWork |
A variant of a recursively unsolvable problem (1946)
NERFINISHED
ⓘ
Finite combinatory processes—formulation 1 (1936) NERFINISHED ⓘ Recursively enumerable sets of positive integers and their decision problems (1944) NERFINISHED ⓘ |
| occupation | university teacher ⓘ |
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.