Triple
T20509166
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | intuitionism |
E503512
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Brouwer–Heyting logic |
—
|
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: Brouwer–Heyting logic | Statement: [intuitionism, relatedTo, Brouwer–Heyting logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Brouwer–Heyting logic Context triple: [intuitionism, relatedTo, Brouwer–Heyting logic]
-
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.
Heyting arithmetic
Heyting arithmetic is a formal system of arithmetic based on intuitionistic logic, serving as the constructive counterpart to classical Peano arithmetic.
-
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 algebra
A Heyting algebra is a type of bounded lattice that models intuitionistic logic by providing an implication operation without requiring the law of excluded middle.
-
E.
Heyting implication
Heyting implication is the intuitionistic logic counterpart of classical material implication, defined within Heyting algebras to capture constructive reasoning about "if–then" statements.
- 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: Brouwer–Heyting logic Target entity description: 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.
-
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.
Heyting arithmetic
Heyting arithmetic is a formal system of arithmetic based on intuitionistic logic, serving as the constructive counterpart to classical Peano arithmetic.
-
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 algebra
A Heyting algebra is a type of bounded lattice that models intuitionistic logic by providing an implication operation without requiring the law of excluded middle.
-
E.
Heyting implication
Heyting implication is the intuitionistic logic counterpart of classical material implication, defined within Heyting algebras to capture constructive reasoning about "if–then" statements.
- 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_69e0b4b1e52c8190894281cf7e3283ab |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e69dc9de788190882ce471966ef2b4 |
completed | April 20, 2026, 9:42 p.m. |
Created at: April 16, 2026, 11:36 a.m.