Precomplete Numberings

dc.contributor.author	Selivanov V.L.
dc.date.accessioned	2022-02-09T20:36:14Z
dc.date.available	2022-02-09T20:36:14Z
dc.date.issued	2021
dc.identifier.issn	1072-3374
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/169326
dc.description.abstract	In this survey, we discuss the theory of precomplete numberings, which appear frequently in computability theory. Precomplete numberings are closely related to some versions of the fixed-point theorem having an important methodological value. Sometimes, this allows one to replace cumbersome proofs based on the so-called priority method by elegant and simple applications of this theorem. In a sense, this paper covers the part of computability theory that may be developed by elementary methods.
dc.relation.ispartofseries	Journal of Mathematical Sciences (United States)
dc.subject	03C57
dc.subject	03D45
dc.subject	complete numbering
dc.subject	hierarchy
dc.subject	index set
dc.subject	numbering
dc.subject	precomplete numbering
dc.subject	reducibility
dc.subject	universality
dc.title	Precomplete Numberings
dc.type	Article
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	256
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	96
dc.source.id	SCOPUS10723374-2021-256-1-SID85106731406

Файлы в этом документе

Размер: 127.5Kb

Формат: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.