Triple
T2597267
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Saul Kripke |
E58260
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Kripke semantics |
E71398
|
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: Kripke semantics | Statement: [Saul Kripke, knownFor, Kripke semantics]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kripke semantics Context triple: [Saul Kripke, knownFor, Kripke semantics]
-
A.
Kripke fixed-point theory of truth
chosen
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.
-
B.
Fregean semantics
Fregean semantics is a theory of meaning in philosophy of language that distinguishes between the sense (Sinn) and reference (Bedeutung) of linguistic expressions to explain how terms can be cognitively significant even when they refer to the same object.
-
C.
Leibnizian logic
Leibnizian logic is the rationalist, formal approach to logic and calculation developed by Gottfried Wilhelm Leibniz, emphasizing symbolic representation, logical calculus, and the reduction of mathematical and philosophical reasoning to precise logical principles.
-
D.
Tarski's undefinability theorem
Tarski's undefinability theorem is a fundamental result in mathematical logic showing that, in sufficiently strong formal systems, the notion of truth for the language of the system cannot be defined within that same language.
-
E.
Tarskian object-language/metalanguage distinction
The Tarskian object-language/metalanguage distinction is a foundational semantic framework that separates the language in which statements are made from the higher-level language used to talk about and define their truth, thereby avoiding self-referential paradoxes like the liar paradox.
- 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_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_69af83c798088190944e7d754aa9aa06 |
completed | March 10, 2026, 2:36 a.m. |
Created at: March 6, 2026, 9:49 p.m.