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 - Sept 2014 |
Externally published | Yes |
Keywords
- Ershov hierarchy
- computable numbering
- minimal numbering
ASJC Scopus subject areas
- Analysis
- Logic
- Algebra and Number Theory