Triple

T23281174
Position Surface form Disambiguated ID Type / Status
Subject Curry–Howard correspondence E588866 entity
Predicate relatedConcept P37 FINISHED
Object Brouwer–Heyting–Kolmogorov interpretation — 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: Brouwer–Heyting–Kolmogorov interpretation | Statement: [Curry–Howard correspondence, relatedConcept, Brouwer–Heyting–Kolmogorov interpretation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Brouwer–Heyting–Kolmogorov interpretation
Context triple: [Curry–Howard correspondence, relatedConcept, Brouwer–Heyting–Kolmogorov interpretation]
  • A. Brouwer–Heyting–Kolmogorov interpretation chosen
    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.
  • B. Brouwer–Heyting logic
    Brouwer–Heyting logic is the standard formal system of intuitionistic logic, capturing constructive reasoning by rejecting the law of excluded middle and other non-constructive classical principles.
  • 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. Heyting arithmetic
    Heyting arithmetic is a formal system of arithmetic based on intuitionistic logic, serving as the constructive counterpart to classical Peano arithmetic.
  • E. Recursive Functions and Intuitionistic Mathematics
    Recursive Functions and Intuitionistic Mathematics is a seminal work by Stephen Kleene that develops the theory of recursive (computable) functions within the framework of intuitionistic logic and mathematics.
  • 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_69e25d16e2c08190a291de254703129e completed April 17, 2026, 4:17 p.m.
NER Named-entity recognition batch_69f19642b46481909fd455acd2155792 completed April 29, 2026, 5:25 a.m.
Created at: April 17, 2026, 4:57 p.m.