Triple
T24225336
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kleene’s recursion theorem |
E601577
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | theorem in recursion theory |
C716
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: theorem in recursion theory Context triple: [Kleene’s recursion theorem, instanceOf, theorem in recursion theory]
-
A.
result in proof theory
In proof theory, a result is a formally derived conclusion or theorem obtained from a given set of axioms and inference rules within a logical system.
-
B.
construction in proof theory
A construction in proof theory is a systematically defined method or procedure used within formal proofs to build objects, derive new statements, or transform existing proofs while preserving logical validity.
-
C.
numbering of partial recursive functions
The numbering of partial recursive functions is a systematic assignment of natural numbers (indices) to all partial recursive functions such that each index effectively encodes a Turing-computable procedure defining that function.
-
D.
result in model theory
In model theory, a result is a formally proven statement—such as a theorem, lemma, or corollary—about structures, theories, or definable sets that follows from the axioms and logical rules of the framework.
-
E.
mathematical theorem
chosen
A mathematical theorem is a rigorously proven statement derived from axioms and previously established results, expressing a fundamental truth within a formal mathematical system.
- F. None of above.
Provenance (1 batch)
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_69e29537ca548190b94a37ebe1977caf |
completed | April 17, 2026, 8:16 p.m. |
Created at: April 18, 2026, midnight