Triple
T9809655
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Herbrand expansion |
E238236
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Herbrand universe |
E238235
|
NE FINISHED |
Named-entity recognition
Before disambiguation, gpt-5-mini classified whether the object phrase is a named entity — the step behind the object's NE type shown above.
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 | Statement: [Herbrand expansion, relatedTo, Herbrand universe]
Disambiguation candidates (1 decision)
The exact options the model was shown at each disambiguation step, with the option it chose highlighted — the evidence behind this triple's disambiguated ids.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Herbrand universe Context triple: [Herbrand expansion, relatedTo, Herbrand universe]
-
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 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.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca84defac48190abc1148804f184c1 |
elicitation | completed |
| NER | batch_69cdb220310c8190a16ca0b746f0ef7a |
ner | completed |
| NED1 | batch_69d1d5aecdec81909fae349945406c6c |
ned_source_triple | completed |
Created at: March 30, 2026, 8:29 p.m.