Triple
T10063116
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Haskell Curry |
E213034
|
entity |
| Predicate | hasConceptNamedAfter |
P3325
|
FINISHED |
| Object | Curry–Howard correspondence |
E588866
|
NE FINISHED |
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: [Haskell Curry, hasConceptNamedAfter, Curry–Howard correspondence]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Curry–Howard correspondence Context triple: [Haskell Curry, hasConceptNamedAfter, 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.
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.
-
D.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
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 (3 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_69ca83977128819084084eb7d1d8c52a |
completed | March 30, 2026, 2:07 p.m. |
| NER | Named-entity recognition | batch_69cdcfd4e4ac8190a37061b4082caa48 |
completed | April 2, 2026, 2:09 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d2e5676eac81909d50bfa7633b6ebe |
completed | April 5, 2026, 10:42 p.m. |
Created at: March 30, 2026, 8:58 p.m.