RUS  ENG
Full version
JOURNALS // Matematicheskie Zametki // Archive

Mat. Zametki, 1969 Volume 6, Issue 1, Pages 3–9 (Mi mzm6891)

This article is cited in 2 papers

Reduction of computable and potentially computable numerations

V. A. Uspenskii

M. V. Lomonosov Moscow State University

Abstract: Among the numerations of classes of countable sets there can be distinguished those in which the number contains information about the set having the number — these are computable and potentially computable numerations — and those in which the set contains information about its number — these are covering and fully covering numerations. The conditions are established which are necessary and sufficient in order that all numerations of the given class should be covering. As a corollary it is established that there exist covering numerations which are not fully covering.

UDC: 51.01.16

Received: 10.06.1968


 English version:
Mathematical Notes, 1969, 6:1, 461–464

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025