Triple
T24714270
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kleene hierarchy |
E601581
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | concept in recursion theory |
C39235
|
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: concept in recursion theory Context triple: [Kleene hierarchy, instanceOf, concept in recursion theory]
-
A.
concept in number theory
A concept in number theory is an abstract idea or construct that describes properties, relationships, or structures involving integers and related numerical systems.
-
B.
set-theoretic concept
A set-theoretic concept is an abstract mathematical idea defined in terms of sets and their elements, relationships, and operations, such as membership, union, intersection, and power sets.
-
C.
concept in knot theory
A concept in knot theory is an abstract idea or construct used to study and classify embeddings of circles (knots) and collections of circles (links) in three-dimensional space up to continuous deformation.
-
D.
foundational principle in theoretical computer science
A foundational principle in theoretical computer science is a core, abstract concept or rule—such as computability, complexity, or formal language theory—that underlies and unifies the study of algorithms, computation models, and their inherent limits.
-
E.
numbering of partial recursive functions
chosen
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.
- 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_69e2d7d6e7a48190bb43b0d8bb1137a0 |
completed | April 18, 2026, 1:01 a.m. |
Created at: April 18, 2026, 3:33 a.m.