Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:Turing_degrees
gptkb:arithmetical_hierarchy recursively enumerable sets |
| gptkbp:describes |
relationship between arithmetical hierarchy and Turing degrees
|
| gptkbp:field |
gptkb:logic
computability theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Post's theorem
|
| gptkbp:namedAfter |
gptkb:Emil_Post
|
| gptkbp:state |
the sets at the nth level of the arithmetical hierarchy are exactly those computable from the nth Turing jump of the empty set
|
| gptkbp:yearProposed |
1944
|
| gptkbp:bfsParent |
gptkb:Emil_Post
|
| gptkbp:bfsLayer |
5
|