RUS
ENG
Full version
JOURNALS
// Algebra i logika
// Archive
Algebra Logika,
2014
Volume 53,
Number 4,
Pages
427–450
(Mi al644)
This article is cited in
7
papers
Families without minimal numberings
K. Sh. Abeshev
,
S. A. Badaev
,
M. Mustafa
Al-Farabi Kazakh National University, Al-Farabi ave. 71, Alma-Ata, 050038, Kazakhstan
Abstract:
It is proved that for any nonzero computable ordinal and its arbitrary notation
$a$
, there exists
$\Sigma_a^{-1}$
-computable family without minimal computable numberings.
Keywords:
computable numbering, Ershov hierarchy, minimal numbering.
UDC:
510.54
Received: 16.11.2013
Fulltext:
PDF file (226 kB)
References
Cited by
English version:
Algebra and Logic, 2014,
53
:4,
271–286
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024