Triple

T20558671
Position Surface form Disambiguated ID Type / Status
Subject Kripke–Kleene semantics in logic programming E504786 entity
Predicate originatesFrom P26 FINISHED
Object Kleene’s strong three-valued logic — 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: Kleene’s strong three-valued logic | Statement: [Kripke–Kleene semantics in logic programming, originatesFrom, Kleene’s strong three-valued logic]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Kleene’s strong three-valued logic
Context triple: [Kripke–Kleene semantics in logic programming, originatesFrom, Kleene’s strong three-valued logic]
  • A. Kleene strong three-valued logic chosen
    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.
  • B. Bochvar three-valued logic
    Bochvar three-valued logic is a paraconsistent logical system that introduces a third truth value to handle semantic paradoxes and meaningless statements by preventing them from yielding classical logical consequences.
  • C. Kripke–Kleene semantics in logic programming
    Kripke–Kleene semantics in logic programming is a three-valued, fixed-point-based approach to interpreting logic programs that captures partial or undefined information without committing to classical true/false evaluations.
  • D. Anderson–Belnap relevant logics
    Anderson–Belnap relevant logics are a family of non-classical logics that require premises to be relevant to conclusions, developed by Alan Anderson and Nuel Belnap as a formal alternative to classical implication.
  • E. 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.
  • 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_69e0b4b6587c8190aee63dc7cff244ea completed April 16, 2026, 10:06 a.m.
NER Named-entity recognition batch_69e6a5e178648190910795bae5422e50 completed April 20, 2026, 10:17 p.m.
Created at: April 16, 2026, 11:38 a.m.