Triple
T24714272
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kleene hierarchy |
E601581
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | concept in arithmetic hierarchy 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 arithmetic hierarchy theory Context triple: [Kleene hierarchy, instanceOf, concept in arithmetic hierarchy theory]
-
A.
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.
-
B.
cumulative hierarchy
The cumulative hierarchy is a conceptual model of the set-theoretic universe built in transfinite stages, where each level consists of all sets that can be formed from the sets at earlier levels.
-
C.
hierarchy of formal grammars
A hierarchy of formal grammars is an organized classification of grammars into levels based on their generative power and structural constraints, such as the Chomsky hierarchy from regular to recursively enumerable languages.
-
D.
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.
-
E.
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.
- 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.