Triple

T10197989
Position Surface form Disambiguated ID Type / Status
Subject Gerhard Gentzen E238811 entity
Predicate knownFor P22 FINISHED
Object sequent calculus
Sequent calculus is a formal logical system introduced by Gerhard Gentzen that represents deductions as sequences (sequents) to analyze and structure proofs, especially in proof theory and logic.
E846921 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: sequent calculus | Statement: [Gerhard Gentzen, knownFor, sequent calculus]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: sequent calculus
Context triple: [Gerhard Gentzen, knownFor, sequent calculus]
  • A. Jones calculus
    Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
  • B. Mueller calculus
    Mueller calculus is a mathematical framework in polarization optics that uses matrix operations to describe how optical elements transform the Stokes parameters of light.
  • C. Curry–Howard correspondence
    The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
  • D. Brouwer–Heyting–Kolmogorov interpretation
    The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
  • E. Scholastic logic
    Scholastic logic is the medieval and early modern tradition of logical theory and teaching, rooted in Aristotelian philosophy and developed in European universities by scholastic theologians and philosophers.
  • 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: sequent calculus
Triple: [Gerhard Gentzen, knownFor, sequent calculus]
Generated description
Sequent calculus is a formal logical system introduced by Gerhard Gentzen that represents deductions as sequences (sequents) to analyze and structure proofs, especially in proof theory and logic.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: sequent calculus
Target entity description: Sequent calculus is a formal logical system introduced by Gerhard Gentzen that represents deductions as sequences (sequents) to analyze and structure proofs, especially in proof theory and logic.
  • A. Jones calculus
    Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
  • B. Mueller calculus
    Mueller calculus is a mathematical framework in polarization optics that uses matrix operations to describe how optical elements transform the Stokes parameters of light.
  • C. Curry–Howard correspondence
    The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
  • D. Brouwer–Heyting–Kolmogorov interpretation
    The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
  • E. Scholastic logic
    Scholastic logic is the medieval and early modern tradition of logical theory and teaching, rooted in Aristotelian philosophy and developed in European universities by scholastic theologians and philosophers.
  • 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_69ca84e1ea088190b38162e43d4cfa8f completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdee3c44408190b09fa41f2d257c04 completed April 2, 2026, 4:19 a.m.
NED1 Entity disambiguation (via context triple) batch_69d317e4a3308190b6ec4252bc55985d completed April 6, 2026, 2:18 a.m.
NEDg Description generation batch_69d31a2a050081908e5b3a14cf02d227 completed April 6, 2026, 2:27 a.m.
NED2 Entity disambiguation (via description) batch_69d31acf46008190b6bf1b111e13bfe9 completed April 6, 2026, 2:30 a.m.
Created at: March 30, 2026, 9:13 p.m.