Triple

T21281453
Position Surface form Disambiguated ID Type / Status
Subject Logic for Computer Science: Foundations of Automatic Theorem Proving E524533 entity
Predicate hasSubject P450 FINISHED
Object Skolemization 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: Skolemization | Statement: [Logic for Computer Science: Foundations of Automatic Theorem Proving, hasSubject, Skolemization]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Skolemization
Context triple: [Logic for Computer Science: Foundations of Automatic Theorem Proving, hasSubject, Skolemization]
  • A. Skolemization chosen
    Skolemization is a logical transformation technique that eliminates existential quantifiers by introducing Skolem functions or constants, commonly used in automated theorem proving and first-order logic.
  • B. Skolem arithmetic
    Skolem arithmetic is a fragment of first-order arithmetic focusing on the natural numbers with multiplication but without addition, studied for its distinctive decidability and model-theoretic properties.
  • C. Herbrand expansion
    Herbrand expansion is a method in mathematical logic that transforms first-order formulas into equivalent (often infinite) propositional combinations by systematically instantiating quantified variables with terms from the Herbrand universe.
  • D. Herbrand's theorem
    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.
  • E. 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.
  • 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_69e0b5171f6c8190a5d57201ede73811 completed April 16, 2026, 10:08 a.m.
NER Named-entity recognition batch_69e736d249fc8190b0b310467ddeac3c completed April 21, 2026, 8:35 a.m.
Created at: April 16, 2026, 4:02 p.m.