K. Sh. Abeshev, S. A. Badaev, M. Mustafa, “Families without minimal numberings”, Algebra Logika, 2014, Volume 53, Number 4,Pages <nobr>427

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