Triple

T20558707
Position Surface form Disambiguated ID Type / Status
Subject First-Order Logic and Automated Theorem Proving E504787 entity
Predicate topic P261 FINISHED
Object Herbrand’s theorem 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: Herbrand’s theorem | Statement: [First-Order Logic and Automated Theorem Proving, topic, Herbrand’s theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Herbrand’s theorem
Context triple: [First-Order Logic and Automated Theorem Proving, topic, Herbrand’s theorem]
  • A. Herbrand's theorem chosen
    Herbrand's theorem is a fundamental result in mathematical logic and proof theory that characterizes the validity of first-order formulas via finite sets of ground instances, forming a basis for automated theorem proving.
  • B. Herbrand semantics
    Herbrand semantics is a formal framework in logic and automated theorem proving that interprets first-order formulas over the Herbrand universe of ground terms to define truth and satisfiability.
  • C. Herbrand universe
    The Herbrand universe is a fundamental concept in mathematical logic and automated theorem proving, consisting of all ground (variable-free) terms that can be built from the function symbols and constants of a given first-order language.
  • D. Herbrand conjunction (for universal formulas)
    A Herbrand conjunction (for universal formulas) is a finite conjunction of ground instances of a universally quantified formula, used in Herbrand’s theorem and automated reasoning to represent universal information over a Herbrand universe.
  • E. Herbrand disjunction
    Herbrand disjunction is a logical formula formed as a finite disjunction of ground instances of a first-order formula, central to Herbrand’s theorem in proof theory and automated reasoning.
  • 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.