The least Σ-jump inversion theorem for N-families

dc.contributor.author	Faizrahmanov M.
dc.contributor.author	Kalimullin I.
dc.contributor.author	Montalbán A.
dc.contributor.author	Puzarenko V.
dc.date.accessioned	2018-04-05T07:09:26Z
dc.date.available	2018-04-05T07:09:26Z
dc.date.issued	2017
dc.identifier.issn	0948-695X
dc.identifier.uri	http://dspace.kpfu.ru/xmlui/handle/net/129737
dc.description.abstract	© J.UCS. Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X ≥ T ∅׳_there is a family of sets F which is the Σ-least countable family whose Σ-jump is Σ-equivalent to X ⊕ X. This fact will be generalized for the class of n-families (families of families of… of sets).
dc.relation.ispartofseries	Journal of Universal Computer Science
dc.subject	Countable family
dc.subject	Enumeration jump
dc.subject	Jump of structure
dc.subject	N-family
dc.subject	Σ-jump
dc.subject	Σ-reducibility
dc.title	The least Σ-jump inversion theorem for N-families
dc.type	Article
dc.relation.ispartofseries-issue	6
dc.relation.ispartofseries-volume	23
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	529
dc.source.id	SCOPUS0948695X-2017-23-6-SID85029430937

Files in this item

Size: 46.20Kb

Format: PDF

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