Triple

T13444213
Position Surface form Disambiguated ID Type / Status
Subject Per Martin-Löf E320437 entity
Predicate areaOfInfluence P9 FINISHED
Object proof theory
Proof theory is a branch of mathematical logic that studies the structure, properties, and formalization of mathematical proofs using symbolic and syntactic methods.
E1041771 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: proof theory | Statement: [Per Martin-Löf, areaOfInfluence, proof theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: proof theory
Context triple: [Per Martin-Löf, areaOfInfluence, proof theory]
  • A. Gentzen-style proof systems
    Gentzen-style proof systems are formal logical calculi, such as natural deduction and sequent calculi, that rigorously structure proofs using inference rules to clarify the foundations of mathematics and logic.
  • B. Recherches sur la théorie de la démonstration
    Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
  • C. Gentzen’s consistency proof for arithmetic
    Gentzen’s consistency proof for arithmetic is a landmark 1930s result in proof theory that established the consistency of Peano arithmetic using transfinite induction up to the ordinal ε₀.
  • D. 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.
  • 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. 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: proof theory
Triple: [Per Martin-Löf, areaOfInfluence, proof theory]
Generated description
Proof theory is a branch of mathematical logic that studies the structure, properties, and formalization of mathematical proofs using symbolic and syntactic methods.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: proof theory
Target entity description: Proof theory is a branch of mathematical logic that studies the structure, properties, and formalization of mathematical proofs using symbolic and syntactic methods.
  • A. Gentzen-style proof systems
    Gentzen-style proof systems are formal logical calculi, such as natural deduction and sequent calculi, that rigorously structure proofs using inference rules to clarify the foundations of mathematics and logic.
  • B. Recherches sur la théorie de la démonstration
    Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
  • C. Gentzen’s consistency proof for arithmetic
    Gentzen’s consistency proof for arithmetic is a landmark 1930s result in proof theory that established the consistency of Peano arithmetic using transfinite induction up to the ordinal ε₀.
  • D. 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.
  • 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. 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_69d80761e6cc8190a90c844589998ecc completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbaee881888190811ddf01bc699864 completed April 12, 2026, 2:40 p.m.
NED1 Entity disambiguation (via context triple) batch_69f739965ef081909e85881ce805bbb5 completed May 3, 2026, 12:03 p.m.
NEDg Description generation batch_69f740e536d48190af369b38aa42438d completed May 3, 2026, 12:34 p.m.
NED2 Entity disambiguation (via description) batch_69f741b72d08819087808bf9bcffa0a1 completed May 3, 2026, 12:38 p.m.
Created at: April 9, 2026, 9:40 p.m.