Triple
T3390236
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kripke fixed-point theory of truth |
E71398
|
entity |
| Predicate | oftenFormalizedWith |
P29507
|
FINISHED |
| Object |
Kleene strong three-valued logic
Kleene strong three-valued logic is a non-classical logical system that extends classical logic with a third truth value to rigorously handle indeterminate or partially defined statements.
|
E353399
|
NE FINISHED |
How this triple was built (5 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: Kleene strong three-valued logic | Statement: [Kripke fixed-point theory of truth, oftenFormalizedWith, Kleene strong three-valued logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kleene strong three-valued logic Context triple: [Kripke fixed-point theory of truth, oftenFormalizedWith, Kleene strong three-valued logic]
-
A.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
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.
Logical Methods in Computer Science
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
D.
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.
-
E.
Introduction to Logical Theory
Introduction to Logical Theory is a mid-20th-century philosophical work by P. F. Strawson that critically examines traditional formal logic and its relation to ordinary language.
- 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: Kleene strong three-valued logic Triple: [Kripke fixed-point theory of truth, oftenFormalizedWith, Kleene strong three-valued logic]
Generated description
Kleene strong three-valued logic is a non-classical logical system that extends classical logic with a third truth value to rigorously handle indeterminate or partially defined statements.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kleene strong three-valued logic Target entity description: Kleene strong three-valued logic is a non-classical logical system that extends classical logic with a third truth value to rigorously handle indeterminate or partially defined statements.
-
A.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
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.
Logical Methods in Computer Science
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
D.
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.
-
E.
Introduction to Logical Theory
Introduction to Logical Theory is a mid-20th-century philosophical work by P. F. Strawson that critically examines traditional formal logic and its relation to ordinary language.
- F. None of above. chosen
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: oftenFormalizedWith Context triple: [Kripke fixed-point theory of truth, oftenFormalizedWith, Kleene strong three-valued logic]
-
A.
formalizedUnder
Indicates that something has been officially established, defined, or codified within the framework, authority, or provisions of a particular formal system, agreement, or institution.
-
B.
isFormalizedBy
Indicates that something is given a defined, structured, or official form through a specific method, process, or representation.
-
C.
formalizedAt
Indicates the point in time or event at which something is officially established, documented, or given formal status.
-
D.
formalismType
chosen
Indicates the specific formal system or representational framework in which something (such as a theory, model, or specification) is expressed.
-
E.
oftenFormulatedOn
Indicates that something (such as a statement, plan, or decision) is frequently based on, derived from, or constructed using another thing as its foundation or starting point.
- F. None of above.
Provenance (6 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_69ad85a9c4a88190a854019341cb3b60 |
completed | March 8, 2026, 2:20 p.m. |
| NER | Named-entity recognition | batch_69adb6682c708190b76a7a16cee7c5aa |
completed | March 8, 2026, 5:48 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b3345a95ac819098be25233b8e0ed5 |
completed | March 12, 2026, 9:47 p.m. |
| NEDg | Description generation | batch_69b33542a1008190a1cc4aec663d97bc |
completed | March 12, 2026, 9:50 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69b3391c4e24819082e9a0f50c1afab8 |
completed | March 12, 2026, 10:07 p.m. |
| PD | Predicate disambiguation | batch_69adadf705608190975423779430cc58 |
completed | March 8, 2026, 5:12 p.m. |
Created at: March 8, 2026, 3:14 p.m.