Triple
T17872034
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Henkin construction |
E446858
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Lindenbaum lemma
The Lindenbaum lemma is a result in mathematical logic stating that any consistent set of formulas in a formal language can be extended to a maximally consistent (complete) theory.
|
E1215845
|
NE FINISHED |
How this triple was built (4 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: Lindenbaum lemma | Statement: [Henkin construction, relatedTo, Lindenbaum lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Lindenbaum lemma Context triple: [Henkin construction, relatedTo, Lindenbaum lemma]
-
A.
König's lemma
König's lemma is a fundamental result in graph theory and logic stating that every finitely branching infinite tree has an infinite path.
-
B.
Ultrafilter lemma
The ultrafilter lemma is a set-theoretic principle weaker than the full Axiom of Choice that guarantees every filter can be extended to an ultrafilter and underlies several key results in topology and analysis.
-
C.
Bailey lemma
The Bailey lemma is a key result in the theory of basic hypergeometric series that provides a systematic method for generating Rogers–Ramanujan-type identities and other q-series relations.
-
D.
Löb's theorem
Löb's theorem is a fundamental result in mathematical logic that characterizes when a sufficiently strong formal system can prove statements about its own provability, closely refining the insights of Gödel’s incompleteness theorems.
-
E.
Łoś–Tarski preservation theorem
The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Lindenbaum lemma Triple: [Henkin construction, relatedTo, Lindenbaum lemma]
Generated description
The Lindenbaum lemma is a result in mathematical logic stating that any consistent set of formulas in a formal language can be extended to a maximally consistent (complete) theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Lindenbaum lemma Target entity description: The Lindenbaum lemma is a result in mathematical logic stating that any consistent set of formulas in a formal language can be extended to a maximally consistent (complete) theory.
-
A.
König's lemma
König's lemma is a fundamental result in graph theory and logic stating that every finitely branching infinite tree has an infinite path.
-
B.
Ultrafilter lemma
chosen
The ultrafilter lemma is a set-theoretic principle weaker than the full Axiom of Choice that guarantees every filter can be extended to an ultrafilter and underlies several key results in topology and analysis.
-
C.
Bailey lemma
The Bailey lemma is a key result in the theory of basic hypergeometric series that provides a systematic method for generating Rogers–Ramanujan-type identities and other q-series relations.
-
D.
Löb's theorem
Löb's theorem is a fundamental result in mathematical logic that characterizes when a sufficiently strong formal system can prove statements about its own provability, closely refining the insights of Gödel’s incompleteness theorems.
-
E.
Łoś–Tarski preservation theorem
The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
- F. None of above.
Provenance (5 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. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0313cdffa8819085ba2ef27abe0700 |
completed | May 12, 2026, 11:49 a.m. |
| NEDg | Description generation | batch_6a0314f1f01c8190b4065637716e845f |
completed | May 12, 2026, 11:54 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a0318a4ca1481909f8ec14b9b8cb422 |
completed | May 12, 2026, 12:10 p.m. |
Created at: April 10, 2026, 10:18 a.m.