Triple
T10462292
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thoralf Skolem |
E246704
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Skolemization |
E822885
|
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: Skolemization | Statement: [Thoralf Skolem, knownFor, Skolemization]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Skolemization Context triple: [Thoralf Skolem, knownFor, 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 (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_69d381c16c248190a2fe5b471e584e9c |
completed | April 6, 2026, 9:49 a.m. |
| NER | Named-entity recognition | batch_69d50884fac48190af22e181b1492557 |
completed | April 7, 2026, 1:37 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d8dc4fbc3481909b214137f26e243b |
completed | April 10, 2026, 11:17 a.m. |
Created at: April 6, 2026, 12:19 p.m.