Triple
T7666864
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Computability Theory |
E173643
|
entity |
| Predicate | hasKeyFigure |
P810
|
FINISHED |
| Object |
Emil Post
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.
|
E681008
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Emil Post | Statement: [Computability Theory, hasKeyFigure, Emil Post]
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.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Emil Post Triple: [Computability Theory, hasKeyFigure, Emil Post]
Generated 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.
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
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69c699562484819086752091e3164a27 |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c701c1383c8190ab5bf803bd6211a9 |
completed | March 27, 2026, 10:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c8a22442dc8190a26c966e7b06f1a9 |
completed | March 29, 2026, 3:53 a.m. |
| NEDg | Description generation | batch_69c8a2ed6a7c8190b5445d8dfd10166d |
completed | March 29, 2026, 3:56 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c8a3937dd08190a1f9e589185a0f93 |
completed | March 29, 2026, 3:59 a.m. |
Created at: March 27, 2026, 4 p.m.