This article is cited in 3 papers

Existence of families without positive numerations

S. S. Marchenkov

Keldysh Applied Mathematics Institute, Academy of Sciences of the USSR

Abstract: An example is constructed of a computable family of recursively enumerable sets which does not have computable positive numerations but does possess a computable minimal numeration.

UDC: 519.9

Received: 31.07.1972

 English version: Mathematical Notes, 1973, 13:4, 360–363

Bibliographic databases:

• 
•