Triple
T9809803
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Herbrand disjunction |
E238239
|
entity |
| Predicate | hasDomain |
P1248
|
FINISHED |
| Object | Herbrand universe of the underlying language |
E238235
|
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: Herbrand universe of the underlying language | Statement: [Herbrand disjunction, hasDomain, Herbrand universe of the underlying language]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Herbrand universe of the underlying language Context triple: [Herbrand disjunction, hasDomain, Herbrand universe of the underlying language]
-
A.
Herbrand universe
chosen
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.
-
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 interpretation
A Herbrand interpretation is a foundational model-theoretic construct in logic and automated theorem proving that interprets formulas over the Herbrand universe built from a theory’s own function symbols and constants.
-
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 base
The Herbrand base is the set of all ground (variable-free) atomic formulas that can be formed from the predicate and constant symbols of a first-order language, serving as the foundational domain for Herbrand semantics and automated theorem proving.
- 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_69ca84defac48190abc1148804f184c1 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb220310c8190a16ca0b746f0ef7a |
completed | April 2, 2026, 12:02 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d20d2cb5108190aa15b60ea76bfa78 |
completed | April 5, 2026, 7:20 a.m. |
Created at: March 30, 2026, 8:29 p.m.