Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Muchnik's_conditional_theorem
|
| gptkbp:countryOfPublication |
gptkb:Russian
|
| gptkbp:field |
gptkb:logic
computability theory |
| gptkbp:namedAfter |
gptkb:Albert_Muchnik
|
| gptkbp:publishedIn |
gptkb:Doklady_Akademii_Nauk_SSSR
|
| gptkbp:relatedTo |
gptkb:Turing_degrees
gptkb:Medvedev's_theorem |
| gptkbp:sentence |
If A and B are recursively enumerable sets and A is not Turing reducible to B, then there exists a recursively enumerable set C such that C is Turing reducible to A, C is not Turing reducible to B, and B is not Turing reducible to C.
|
| gptkbp:yearProved |
1963
|
| gptkbp:bfsParent |
gptkb:Andrey_Muchnik
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Muchnik's theorem
|