Triple
T16614756
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Formulario Mathematico |
E403668
|
entity |
| Predicate | uses |
P98
|
FINISHED |
| Object | Peano axioms for natural numbers |
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 axioms for natural numbers | Statement: [Formulario Mathematico, uses, Peano axioms for natural numbers]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Peano axioms for natural numbers Context triple: [Formulario Mathematico, uses, Peano axioms for natural numbers]
-
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.
Robinson arithmetic
Robinson arithmetic is a weak formal system of arithmetic that captures basic properties of the natural numbers but is strictly weaker and less expressive than full Peano arithmetic.
-
C.
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.
-
D.
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.
-
E.
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.
- 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_69d883897eb481909eaaa088ba9918d9 |
completed | April 10, 2026, 4:58 a.m. |
| NER | Named-entity recognition | batch_69e3609935a88190baa56f3a42b2ecd1 |
completed | April 18, 2026, 10:44 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0075aeaa9881908bdef0f9f2b52e60 |
completed | May 10, 2026, 12:10 p.m. |
Created at: April 10, 2026, 5:17 a.m.