Triple

T1861726
Position Surface form Disambiguated ID Type / Status
Subject Alonzo Church E34828 entity
Predicate notableWork P4 FINISHED
Object Church’s theorem on the undecidability of first-order logic E87086 NE FINISHED

How this triple was built (2 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: Church’s theorem on the undecidability of first-order logic | Statement: [Alonzo Church, notableWork, Church’s theorem on the undecidability of first-order logic]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Church’s theorem on the undecidability of first-order logic
Context triple: [Alonzo Church, notableWork, Church’s theorem on the undecidability of first-order logic]
  • A. Tarski's undefinability theorem
    Tarski's undefinability theorem is a fundamental result in mathematical logic showing that, in sufficiently strong formal systems, the notion of truth for the language of the system cannot be defined within that same language.
  • B. completeness theorem for first-order logic
    The completeness theorem for first-order logic is a fundamental result in mathematical logic, proved by Kurt Gödel, which states that every logically valid first-order formula is provable from the axioms of first-order logic.
  • C. Gödel's incompleteness theorems
    Gödel's incompleteness theorems are two fundamental results in mathematical logic showing that any sufficiently powerful, consistent formal system cannot prove all true statements about arithmetic, and cannot prove its own consistency.
  • D. Entscheidungsproblem chosen
    The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
  • E. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69a88600b2f88190bc09303e68ab517e completed March 4, 2026, 7:20 p.m.
NER Named-entity recognition batch_69abb09e714881909cef0f7e77b5b3b9 completed March 7, 2026, 4:59 a.m.
NED1 Entity disambiguation (via context triple) batch_69add1d026748190a507872de85c908d completed March 8, 2026, 7:45 p.m.
Created at: March 4, 2026, 7:34 p.m.