This article is cited in 1 paper

$m$-Degrees of supersets of simple sets

A. N. Degtev

Tyumen State University

Abstract: It is proved that there exists a simple, but not hypersimple, set $A$ such that $B\underset{\displaystyle m}\le A$ whenever $A\subseteq B$ for every recursively enumerable set $B$.

UDC: 517.11

Received: 17.12.1976

 English version: Mathematical Notes, 1987, 23:6, 488–490

Bibliographic databases:

• 
•