Triple
T3390149
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gödel's incompleteness theorems |
E71396
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Peano arithmetic |
E353625
|
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: Peano arithmetic | Statement: [Gödel's incompleteness theorems, relatedTo, Peano arithmetic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Peano arithmetic Context triple: [Gödel's incompleteness theorems, relatedTo, Peano arithmetic]
-
A.
Peano arithmetic
chosen
Peano arithmetic is a formal first-order axiomatic system that captures the basic properties of the natural numbers and underpins much of modern mathematical logic and number theory.
-
B.
Gödel numbering
Gödel numbering is a method in mathematical logic that encodes symbols, formulas, and proofs as unique natural numbers, enabling arithmetic to represent and reason about syntactic statements.
-
C.
Lectures on the Logic of Arithmetic
Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
-
D.
Peano notation
Peano notation is a formal symbolic system for representing natural numbers and arithmetic operations using axioms and successor functions, developed by Giuseppe Peano.
-
E.
Hilbert’s program
Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
- 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_69ad85a9c4a88190a854019341cb3b60 |
completed | March 8, 2026, 2:20 p.m. |
| NER | Named-entity recognition | batch_69adb6682c708190b76a7a16cee7c5aa |
completed | March 8, 2026, 5:48 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b34bc62c788190b6097e02601df386 |
completed | March 12, 2026, 11:27 p.m. |
Created at: March 8, 2026, 3:14 p.m.