Some remarks on completion of numberings
We present some examples and constructions in the theory of complete numberings and completions of numberings that partially answer a few questions of .
Keywordsnumbering computability complete numbering Rogers semilattice computability with an oracle arithmetical numbering
Unable to display preview. Download preview PDF.
- 1.Badaev S., Goncharov S., and Sorbi A., “Completeness and universality of arithmetical numberings,” in: Computability and Models, Kluwer Academic Publishers, New York, 2003, pp. 11–44.Google Scholar
- 2.Mal’tsev A. I., “Sets with complete numberings,” Algebra and Logic, 2, No. 2, 353–378 (1963).Google Scholar
- 3.Ershov Yu. L., Theory of Numberings [in Russian], Nauka, Moscow (1977).Google Scholar
© Pleiades Publishing, Ltd. 2008