The enumeration spectrum hierarchy of n-families

dc.contributor.author	Faizrahmanov M.
dc.contributor.author	Kalimullin I.
dc.date.accessioned	2018-09-19T20:41:21Z
dc.date.available	2018-09-19T20:41:21Z
dc.date.issued	2016
dc.identifier.issn	0942-5616
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/143138
dc.description.abstract	© 2016 WILEY-VCH Verlag GmbH & Co. KGaA, WeinheimWe introduce a hierarchy of sets which can be derived from the integers using countable collections. Such families can be coded into countable algebraic structures preserving their algorithmic properties. We prove that for different finite levels of the hierarchy the corresponding algebraic structures have different classes of possible degree spectra.
dc.relation.ispartofseries	Mathematical Logic Quarterly
dc.title	The enumeration spectrum hierarchy of n-families
dc.type	Article
dc.relation.ispartofseries-issue	4-5
dc.relation.ispartofseries-volume	62
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	420
dc.source.id	SCOPUS09425616-2016-62-45-SID84965180637

Files in this item

Name: SCOPUS09425616-20 ...

Size: 43.53Kb

Format: PDF

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