Triple

T18793247
Position Surface form Disambiguated ID Type / Status
Subject Brouwer–Heyting–Kolmogorov interpretation E459568 entity
Predicate influenced P9 FINISHED
Object Curry–Howard correspondence — NE NERFINISHED

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: Curry–Howard correspondence | Statement: [Brouwer–Heyting–Kolmogorov interpretation, influenced, Curry–Howard correspondence]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Curry–Howard correspondence
Context triple: [Brouwer–Heyting–Kolmogorov interpretation, influenced, Curry–Howard correspondence]
  • A. Curry–Howard correspondence chosen
    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.
  • B. 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.
  • C. Martin-Löf type theory
    Martin-Löf type theory is a foundational system for constructive mathematics and computer science that integrates logic and computation through dependent types and serves as a basis for proof assistants and functional programming languages.
  • D. Calculus of Inductive Constructions
    Calculus of Inductive Constructions is a powerful type theory that combines higher-order logic with inductive types and dependent types, forming the formal foundation of the Coq proof assistant.
  • E. 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.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (2 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_69d8d396f54c8190ba49db31e8743842 completed April 10, 2026, 10:40 a.m.
NER Named-entity recognition batch_69e59787e5988190883ed575ab4b6dec completed April 20, 2026, 3:03 a.m.
Created at: April 10, 2026, 11:53 a.m.