Triple

T14094218
Position Surface form Disambiguated ID Type / Status
Subject new riddle of induction E339209 entity
Predicate relatedTo P37 FINISHED
Object Goodman’s paradox
Goodman’s paradox is a philosophical problem in the theory of induction that challenges how we justify projecting certain predicates (like “green”) into the future rather than equally compatible but gerrymandered ones (like “grue”).
E1079346 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: Goodman’s paradox | Statement: [new riddle of induction, relatedTo, Goodman’s paradox]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Goodman’s paradox
Context triple: [new riddle of induction, relatedTo, Goodman’s paradox]
  • A. Yablo's paradox
    Yablo's paradox is a self-referential logical paradox involving an infinite sequence of sentences, each saying that all later sentences in the sequence are false, which challenges traditional notions of semantic paradox and self-reference.
  • B. Moore's paradox
    Moore's paradox is a philosophical problem highlighting the oddity of asserting a sentence like "It is raining, but I don't believe that it is raining," which seems logically consistent yet pragmatically absurd.
  • C. Berry paradox
    The Berry paradox is a self-referential logical paradox arising from phrases like “the smallest positive integer not definable in under eleven words,” which appears to define exactly such a number while claiming it cannot be defined.
  • D. Hempel's paradox
    Hempel's paradox is a famous problem in the philosophy of science that challenges our intuitions about confirmation by showing how evidence seemingly unrelated to a hypothesis can still count as confirming it.
  • E. Barber paradox
    The Barber paradox is a self-referential logical puzzle about a barber who shaves all and only those who do not shave themselves, illustrating a contradiction similar to Russell’s paradox.
  • 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: Goodman’s paradox
Triple: [new riddle of induction, relatedTo, Goodman’s paradox]
Generated description
Goodman’s paradox is a philosophical problem in the theory of induction that challenges how we justify projecting certain predicates (like “green”) into the future rather than equally compatible but gerrymandered ones (like “grue”).
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Goodman’s paradox
Target entity description: Goodman’s paradox is a philosophical problem in the theory of induction that challenges how we justify projecting certain predicates (like “green”) into the future rather than equally compatible but gerrymandered ones (like “grue”).
  • A. Yablo's paradox
    Yablo's paradox is a self-referential logical paradox involving an infinite sequence of sentences, each saying that all later sentences in the sequence are false, which challenges traditional notions of semantic paradox and self-reference.
  • B. Moore's paradox
    Moore's paradox is a philosophical problem highlighting the oddity of asserting a sentence like "It is raining, but I don't believe that it is raining," which seems logically consistent yet pragmatically absurd.
  • C. Berry paradox
    The Berry paradox is a self-referential logical paradox arising from phrases like “the smallest positive integer not definable in under eleven words,” which appears to define exactly such a number while claiming it cannot be defined.
  • D. Hempel's paradox
    Hempel's paradox is a famous problem in the philosophy of science that challenges our intuitions about confirmation by showing how evidence seemingly unrelated to a hypothesis can still count as confirming it.
  • E. Barber paradox
    The Barber paradox is a self-referential logical puzzle about a barber who shaves all and only those who do not shave themselves, illustrating a contradiction similar to Russell’s paradox.
  • 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_69d81c69b5c8819094aa1abf18302908 completed April 9, 2026, 9:38 p.m.
NER Named-entity recognition batch_69de5fb7fb3c819083266dbe7e93aaff completed April 14, 2026, 3:39 p.m.
NED1 Entity disambiguation (via context triple) batch_69fcd0aa2fbc8190b86fea2306363f1b completed May 7, 2026, 5:49 p.m.
NEDg Description generation batch_69fcd21a2a408190ab335e99fcbbd9ae completed May 7, 2026, 5:55 p.m.
NED2 Entity disambiguation (via description) batch_69fcd2e1b2ec81909caab1bfc6394258 completed May 7, 2026, 5:58 p.m.
Created at: April 9, 2026, 10:22 p.m.