Triple

T839964
Position Surface form Disambiguated ID Type / Status
Subject Kurt Gödel E18153 entity
Predicate influenced P9 FINISHED
Object Solomon Feferman
Solomon Feferman was an American logician and philosopher of mathematics known for his influential work on proof theory, predicativity, and the foundations and history of mathematical logic.
E102650 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: Solomon Feferman | Statement: [Kurt Gödel, influenced, Solomon Feferman]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Solomon Feferman
Context triple: [Kurt Gödel, influenced, Solomon Feferman]
  • A. Martin Davis
    Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
  • B. John Alan Robinson
    John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
  • C. Saul Kripke
    Saul Kripke was an American philosopher and logician renowned for his groundbreaking work in modal logic, the philosophy of language, and metaphysics, particularly his theories of naming and necessity.
  • D. Paul Cohen
    Paul Cohen was an American mathematician renowned for developing the method of forcing and proving the independence of the continuum hypothesis and the axiom of choice from Zermelo–Fraenkel set theory.
  • E. Kurt Gödel
    Kurt Gödel was a pioneering logician and mathematician best known for his incompleteness theorems, which fundamentally transformed the foundations of mathematics and logic.
  • 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: Solomon Feferman
Triple: [Kurt Gödel, influenced, Solomon Feferman]
Generated description
Solomon Feferman was an American logician and philosopher of mathematics known for his influential work on proof theory, predicativity, and the foundations and history of mathematical logic.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Solomon Feferman
Target entity description: Solomon Feferman was an American logician and philosopher of mathematics known for his influential work on proof theory, predicativity, and the foundations and history of mathematical logic.
  • A. Martin Davis
    Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
  • B. John Alan Robinson
    John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
  • C. Saul Kripke
    Saul Kripke was an American philosopher and logician renowned for his groundbreaking work in modal logic, the philosophy of language, and metaphysics, particularly his theories of naming and necessity.
  • D. Paul Cohen
    Paul Cohen was an American mathematician renowned for developing the method of forcing and proving the independence of the continuum hypothesis and the axiom of choice from Zermelo–Fraenkel set theory.
  • E. Kurt Gödel
    Kurt Gödel was a pioneering logician and mathematician best known for his incompleteness theorems, which fundamentally transformed the foundations of mathematics and logic.
  • 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_69a49389f44881909a608fb27d89f247 completed March 1, 2026, 7:29 p.m.
NER Named-entity recognition batch_69a4abe5d7848190b15e0cb343b6f4ba completed March 1, 2026, 9:13 p.m.
NED1 Entity disambiguation (via context triple) batch_69a7a3b8c9b081908fd04ac23d45e932 completed March 4, 2026, 3:15 a.m.
NEDg Description generation batch_69a7a9696c108190a25271f7fe4b2ccd completed March 4, 2026, 3:39 a.m.
NED2 Entity disambiguation (via description) batch_69a7aa75fb908190bd70054288c249ec completed March 4, 2026, 3:43 a.m.
Created at: March 1, 2026, 7:38 p.m.