Partial Decidable Presentations in Hyperarithmetic

dc.contributor.author	Kalimullin I.
dc.contributor.author	Puzarenko V.
dc.contributor.author	Faizrahmanov M.
dc.date.accessioned	2020-01-21T20:33:31Z
dc.date.available	2020-01-21T20:33:31Z
dc.date.issued	2019
dc.identifier.issn	0037-4466
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/157429
dc.description.abstract	© 2019, Pleiades Publishing, Inc. We study the problem of the existence of decidable and positive Π11- and Σ11-numberings of the families of Π11- and Σ11-cones with respect to inclusion. Some laws are found that reflect the presence of decidable computable Π11- and Σ11-numberings of these families in dependence on the analytical complexity of the set defining a cone.
dc.relation.ispartofseries	Siberian Mathematical Journal
dc.subject	computable numbering
dc.subject	computable set
dc.subject	computably enumerable set
dc.subject	constructible admissible set
dc.subject	decidable numbering
dc.subject	e-reducibility
dc.subject	hyperarithmetic set
dc.subject	numbering
dc.subject	positive numbering
dc.title	Partial Decidable Presentations in Hyperarithmetic
dc.type	Article
dc.relation.ispartofseries-issue	3
dc.relation.ispartofseries-volume	60
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	464
dc.source.id	SCOPUS00374466-2019-60-3-SID85067297474

Files in this item

Size: 78.94Kb

Format: PDF

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