Triple
T18793250
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Brouwer–Heyting–Kolmogorov interpretation |
E459568
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | constructive type theory |
—
|
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: constructive type theory | Statement: [Brouwer–Heyting–Kolmogorov interpretation, relatedTo, constructive type theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: constructive type theory Context triple: [Brouwer–Heyting–Kolmogorov interpretation, relatedTo, constructive type theory]
-
A.
Martin-Löf type theory
chosen
Martin-Löf type theory is a foundational system for constructive mathematics and computer science that integrates logic and computation through dependent types and serves as a basis for proof assistants and functional programming languages.
-
B.
calculus of constructions
The calculus of constructions is a powerful type theory and foundational formal system that unifies higher-order logic and typed lambda calculus, serving as the basis for several modern proof assistants.
-
C.
Calculus of Inductive Constructions
Calculus of Inductive Constructions is a powerful type theory that combines higher-order logic with inductive types and dependent types, forming the formal foundation of the Coq proof assistant.
-
D.
homotopy type theory
Homotopy type theory is a branch of mathematical logic and foundations that interprets types as spaces and equalities as paths, connecting type theory with homotopy theory and higher category theory.
-
E.
constructive set theory
Constructive set theory is a branch of mathematical logic that develops set theory using intuitionistic (constructive) logic and often weaker axioms, avoiding classical principles like unrestricted law of excluded middle.
- 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_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.