Triple

T17230072
Position Surface form Disambiguated ID Type / Status
Subject Hilbert-style deductive systems E418216 entity
Predicate hasVariant P455 FINISHED
Object Hilbert system for propositional logic E418216 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: Hilbert system for propositional logic | Statement: [Hilbert-style deductive systems, hasVariant, Hilbert system for propositional logic]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Hilbert system for propositional logic
Context triple: [Hilbert-style deductive systems, hasVariant, Hilbert system for propositional logic]
  • A. Hilbert-style deductive systems chosen
    Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
  • B. Hilbert–Bernays derivability conditions
    The Hilbert–Bernays derivability conditions are a set of formal requirements on provability predicates in arithmetic that underpin key results in mathematical logic, including Gödel’s incompleteness theorems and Löb’s theorem.
  • C. Gentzen-style proof systems
    Gentzen-style proof systems are formal logical calculi, such as natural deduction and sequent calculi, that rigorously structure proofs using inference rules to clarify the foundations of mathematics and logic.
  • D. Gödel–Löb provability logic (GL)
    Gödel–Löb provability logic (GL) is a modal logic system that formalizes reasoning about provability in arithmetic, capturing the behavior of the provability predicate in Peano Arithmetic.
  • E. "Logic for Computer Science: Foundations of Automatic Theorem Proving"
    "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
  • 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_69d886d8e96081909870bff6c3d0bf09 completed April 10, 2026, 5:12 a.m.
NER Named-entity recognition batch_69e42df62ec48190b2ed633a5bcc0255 completed April 19, 2026, 1:20 a.m.
NED1 Entity disambiguation (via context triple) batch_6a01675eae08819093427b4dc1ffee5f completed May 11, 2026, 5:21 a.m.
Created at: April 10, 2026, 5:39 a.m.