Reducibility on families

dc.contributor.author	Kalimullin S.
dc.contributor.author	Puzarenko V.
dc.date.accessioned	2018-09-18T20:01:11Z
dc.date.available	2018-09-18T20:01:11Z
dc.date.issued	2009
dc.identifier.issn	0002-5232
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/135791
dc.description.abstract	A reducibility on families of subsets of natural numbers is introduced which allows the family per se to be treated without its representation by natural numbers being fixed. This reducibility is used to study a series of problems both in classical computability and on admissible sets: for example, describing index sets of families belonging to sum-3, generalizing Friedberg's completeness theorem for a suitable reducibility on admissible sets, etc. © 2009 Springer Science+Business Media, Inc.
dc.relation.ispartofseries	Algebra and Logic
dc.subject	Admissible set
dc.subject	Family of subsets of natural numbers
dc.subject	Reducibility
dc.title	Reducibility on families
dc.type	Article
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	48
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	20
dc.source.id	SCOPUS00025232-2009-48-1-SID63949083501

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

Имя: SCOPUS00025232-20 ...

Размер: 43.67Kb

Формат: PDF

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