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 |
How this entity was disambiguated
This entity first appeared as the object of triple T7666864 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Emil Post Context triple: [Computability Theory, hasKeyFigure, Emil Post]
-
A.
Stephen Kleene
Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
-
B.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
C.
Jacques Herbrand
Jacques Herbrand was a French mathematician and logician known for his foundational contributions to proof theory and mathematical logic, particularly Herbrand's theorem.
-
D.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
E.
J. Barkley Rosser
J. Barkley Rosser was an American logician and mathematician known for his influential work in mathematical logic, including contributions to lambda calculus and proof theory.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Emil Post Target entity description: 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.
-
A.
Stephen Kleene
Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
-
B.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
C.
Jacques Herbrand
Jacques Herbrand was a French mathematician and logician known for his foundational contributions to proof theory and mathematical logic, particularly Herbrand's theorem.
-
D.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
E.
J. Barkley Rosser
J. Barkley Rosser was an American logician and mathematician known for his influential work in mathematical logic, including contributions to lambda calculus and proof theory.
- F. None of above. chosen
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 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Emil Post Description of subject: 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.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.