Triple
T20509148
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | intuitionism |
E503512
|
entity |
| Predicate | associatedWith |
P37
|
FINISHED |
| Object | Heyting arithmetic |
—
|
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: Heyting arithmetic | Statement: [intuitionism, associatedWith, Heyting arithmetic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Heyting arithmetic Context triple: [intuitionism, associatedWith, Heyting arithmetic]
-
A.
Heyting arithmetic
chosen
Heyting arithmetic is a formal system of arithmetic based on intuitionistic logic, serving as the constructive counterpart to classical Peano arithmetic.
-
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.
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.
-
D.
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.
-
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_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.