Abstract
It is proved that for any nonzero computable ordinal and its arbitrary notation a, there exists a Σa − 1-computable family without minimal computable numberings.
| Original language | English |
|---|---|
| Pages (from-to) | 271-286 |
| Number of pages | 16 |
| Journal | Algebra and Logic |
| Volume | 53 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2014 |
| Externally published | Yes |
Fingerprint
Keywords
- computable numbering
- Ershov hierarchy
- minimal numbering
ASJC Scopus subject areas
- Analysis
- Logic
Cite this
Families Without Minimal Numberings. / Abeshev, K. Sh; Badaev, S. A.; Mustafa, M.
In: Algebra and Logic, Vol. 53, No. 4, 2014, p. 271-286.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Families Without Minimal Numberings
AU - Abeshev, K. Sh
AU - Badaev, S. A.
AU - Mustafa, M.
PY - 2014
Y1 - 2014
N2 - It is proved that for any nonzero computable ordinal and its arbitrary notation a, there exists a Σa − 1-computable family without minimal computable numberings.
AB - It is proved that for any nonzero computable ordinal and its arbitrary notation a, there exists a Σa − 1-computable family without minimal computable numberings.
KW - computable numbering
KW - Ershov hierarchy
KW - minimal numbering
UR - http://www.scopus.com/inward/record.url?scp=84922074779&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84922074779&partnerID=8YFLogxK
U2 - 10.1007/s10469-014-9290-9
DO - 10.1007/s10469-014-9290-9
M3 - Article
AN - SCOPUS:84922074779
VL - 53
SP - 271
EP - 286
JO - Algebra and Logic
JF - Algebra and Logic
SN - 0002-5232
IS - 4
ER -