Families Without Minimal Numberings

Abeshev, Kuanysh; Badaev, Serikzhan; Mustafa, Manat

doi:https://doi.org/10.1007/s10469-014-9290-9

Families Without Minimal Numberings

Files

Familis without minimal numberings.pdf (212.56 KB)

Date

2014

Authors

Abeshev, Kuanysh

Badaev, Serikzhan

Mustafa, Manat

Publisher

Springer Nature

Abstract

It is proved that for any nonzero computable ordinal and its arbitrary notation a, there exists a Σ − 1a -computable family without minimal computable numberings.

Keywords

Mathematics, Computable Numbering, Ershov Hierarchy, Minimal Numbering

Citation

Abeshev, K.S., Badaev, S.A. & Mustafa, M. Families Without Minimal Numberings. Algebra Logic 53, 271–286 (2014). https://doi.org/10.1007/s10469-014-9290-9