Triple

T18793339
Position Surface form Disambiguated ID Type / Status
Subject Arend Heyting E459570 entity
Predicate hasConceptNamedAfter P3325 FINISHED
Object Heyting implication NE NERFINISHED

How this triple was built (3 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: Heyting implication | Statement: [Arend Heyting, hasConceptNamedAfter, Heyting implication]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Heyting implication
Context triple: [Arend Heyting, hasConceptNamedAfter, Heyting implication]
  • A. 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.
  • B. 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.
  • C. Hilbert–Bernays derivability conditions
    The Hilbert–Bernays derivability conditions are a set of formal requirements on provability predicates in arithmetic that underpin key results in mathematical logic, including Gödel’s incompleteness theorems and Löb’s theorem.
  • D. Gödel–Löb provability logic (GL)
    Gödel–Löb provability logic (GL) is a modal logic system that formalizes reasoning about provability in arithmetic, capturing the behavior of the provability predicate in Peano Arithmetic.
  • E. Proof Methods for Modal and Intuitionistic Logics
    "Proof Methods for Modal and Intuitionistic Logics" is a foundational textbook by logician Melvin Fitting that systematically develops semantic and proof-theoretic techniques for reasoning in modal and intuitionistic logic systems.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Heyting implication
Target entity description: Heyting implication is the intuitionistic logic counterpart of classical material implication, defined within Heyting algebras to capture constructive reasoning about "if–then" statements.
  • A. 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.
  • B. 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.
  • C. Hilbert–Bernays derivability conditions
    The Hilbert–Bernays derivability conditions are a set of formal requirements on provability predicates in arithmetic that underpin key results in mathematical logic, including Gödel’s incompleteness theorems and Löb’s theorem.
  • D. Gödel–Löb provability logic (GL)
    Gödel–Löb provability logic (GL) is a modal logic system that formalizes reasoning about provability in arithmetic, capturing the behavior of the provability predicate in Peano Arithmetic.
  • E. Proof Methods for Modal and Intuitionistic Logics
    "Proof Methods for Modal and Intuitionistic Logics" is a foundational textbook by logician Melvin Fitting that systematically develops semantic and proof-theoretic techniques for reasoning in modal and intuitionistic logic systems.
  • F. None of above. chosen

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.