Triple
T13444214
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Per Martin-Löf |
E320437
|
entity |
| Predicate | hasConceptNamedAfter |
P3325
|
FINISHED |
| Object | Martin-Löf type theory |
E1041769
|
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: Martin-Löf type theory | Statement: [Per Martin-Löf, hasConceptNamedAfter, Martin-Löf type theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Martin-Löf type theory Context triple: [Per Martin-Löf, hasConceptNamedAfter, Martin-Löf 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.
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.
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.
-
D.
univalent foundations program
The univalent foundations program is a research initiative that redefines the foundations of mathematics using homotopy type theory, emphasizing computationally verifiable proofs and new connections between logic, topology, and category theory.
-
E.
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.
- 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_69d80761e6cc8190a90c844589998ecc |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbaee881888190811ddf01bc699864 |
completed | April 12, 2026, 2:40 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f74621474c8190b96a8f8561451bed |
completed | May 3, 2026, 12:57 p.m. |
Created at: April 9, 2026, 9:40 p.m.