Triple
T2597263
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Saul Kripke |
E58260
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
A Completeness Theorem in Modal Logic
A Completeness Theorem in Modal Logic is a seminal work by Saul Kripke that established the soundness and completeness of modal logics via possible-worlds semantics, fundamentally shaping modern modal logic.
|
E281889
|
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: A Completeness Theorem in Modal Logic | Statement: [Saul Kripke, notableWork, A Completeness Theorem in Modal Logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: A Completeness Theorem in Modal Logic Context triple: [Saul Kripke, notableWork, A Completeness Theorem in Modal Logic]
-
A.
Semantical Considerations on Modal Logic
Semantical Considerations on Modal Logic is a landmark philosophical paper by Saul Kripke that helped found possible-worlds semantics and revolutionized the study of modal logic.
-
B.
Kripke fixed-point theory of truth
The Kripke fixed-point theory of truth is a semantic framework developed by Saul Kripke that uses partial truth predicates and fixed points to consistently handle self-referential sentences and semantic paradoxes like the liar paradox.
-
C.
Recherches sur la théorie de la démonstration
Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
-
D.
completeness theorem for first-order logic
The completeness theorem for first-order logic is a fundamental result in mathematical logic, proved by Kurt Gödel, which states that every logically valid first-order formula is provable from the axioms of first-order logic.
-
E.
Gödel's ontological proof
Gödel's ontological proof is a formal, modal-logic-based argument for the existence of God that rigorously develops and refines earlier ontological arguments within a precise axiomatic framework.
- 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: A Completeness Theorem in Modal Logic Triple: [Saul Kripke, notableWork, A Completeness Theorem in Modal Logic]
Generated description
A Completeness Theorem in Modal Logic is a seminal work by Saul Kripke that established the soundness and completeness of modal logics via possible-worlds semantics, fundamentally shaping modern modal logic.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: A Completeness Theorem in Modal Logic Target entity description: A Completeness Theorem in Modal Logic is a seminal work by Saul Kripke that established the soundness and completeness of modal logics via possible-worlds semantics, fundamentally shaping modern modal logic.
-
A.
Semantical Considerations on Modal Logic
chosen
Semantical Considerations on Modal Logic is a landmark philosophical paper by Saul Kripke that helped found possible-worlds semantics and revolutionized the study of modal logic.
-
B.
Kripke fixed-point theory of truth
The Kripke fixed-point theory of truth is a semantic framework developed by Saul Kripke that uses partial truth predicates and fixed points to consistently handle self-referential sentences and semantic paradoxes like the liar paradox.
-
C.
Recherches sur la théorie de la démonstration
Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
-
D.
completeness theorem for first-order logic
The completeness theorem for first-order logic is a fundamental result in mathematical logic, proved by Kurt Gödel, which states that every logically valid first-order formula is provable from the axioms of first-order logic.
-
E.
Gödel's ontological proof
Gödel's ontological proof is a formal, modal-logic-based argument for the existence of God that rigorously develops and refines earlier ontological arguments within a precise axiomatic framework.
- 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_69ab4ac14040819098b13f4a27d5c8ff |
completed | March 6, 2026, 9:44 p.m. |
| NER | Named-entity recognition | batch_69abd4548b1081909d28f88ea5e14202 |
completed | March 7, 2026, 7:31 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69af907b01d4819090bfd0c8ec1bf70e |
completed | March 10, 2026, 3:31 a.m. |
| NEDg | Description generation | batch_69af91625bd481908d3666af3cd3733f |
completed | March 10, 2026, 3:34 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69af91f9e1208190aa149c9afc84911c |
completed | March 10, 2026, 3:37 a.m. |
Created at: March 6, 2026, 9:49 p.m.