Triple
T17872022
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Henkin construction |
E446858
|
entity |
| Predicate | introduces |
P201
|
FINISHED |
| Object | Henkin constants |
—
|
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: Henkin constants | Statement: [Henkin construction, introduces, Henkin constants]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Henkin constants Context triple: [Henkin construction, introduces, Henkin constants]
-
A.
Henkin construction
chosen
Henkin construction is a model-building technique in first-order logic that extends a theory with new constants to ensure every consistent set of sentences has a model, thereby proving completeness.
-
B.
Henkin
Henkin is a surname most notably associated with Leon Henkin, an influential logician known for his work in the foundations of mathematics and completeness in first-order logic.
-
C.
Hensel
Hensel is a German surname most notably associated with mathematician Kurt Hensel, known for introducing p-adic numbers.
-
D.
Herbrand quotient
The Herbrand quotient is an invariant in algebraic number theory and group cohomology that measures the relative sizes of certain cohomology groups associated with a finite group action on a module.
-
E.
Hilbert–Bernays derivability conditions
The Hilbert–Bernays derivability conditions are a set of formal requirements on provability predicates in arithmetic that underpin key results in mathematical logic, including Gödel’s incompleteness theorems and Löb’s theorem.
- 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_69d8b9f4c22c819093c2680434472894 |
completed | April 10, 2026, 8:51 a.m. |
| NER | Named-entity recognition | batch_69e49aa30ff8819090c51c1d7767e952 |
completed | April 19, 2026, 9:04 a.m. |
Created at: April 10, 2026, 10:18 a.m.