Triple
T7666836
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Computability Theory |
E173643
|
entity |
| Predicate | fieldOfStudy |
P3
|
FINISHED |
| Object | Gödel numbering |
E100622
|
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: Gödel numbering | Statement: [Computability Theory, fieldOfStudy, Gödel numbering]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gödel numbering Context triple: [Computability Theory, fieldOfStudy, Gödel numbering]
-
A.
Gödel numbering
chosen
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.
-
B.
Kleene numbering
Kleene numbering is a method in computability theory for effectively assigning natural numbers to partial recursive functions, refining Gödel numbering to study algorithmic properties of functions.
-
C.
Peano arithmetic
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.
-
D.
Gödel's incompleteness theorems
Gödel's incompleteness theorems are two fundamental results in mathematical logic showing that any sufficiently powerful, consistent formal system cannot prove all true statements about arithmetic, and cannot prove its own consistency.
-
E.
arithmetization of syntax
Arithmetization of syntax is a method in mathematical logic that encodes formal language expressions and proofs as natural numbers so that syntactic properties can be studied using arithmetic.
- 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_69c699562484819086752091e3164a27 |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c701c1383c8190ab5bf803bd6211a9 |
completed | March 27, 2026, 10:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c89b260000819088d744ea8dc53cd2 |
completed | March 29, 2026, 3:23 a.m. |
Created at: March 27, 2026, 4 p.m.