Enumeration degrees and enumerability of familes

dc.contributor.author	Kalimullin I.
dc.date.accessioned	2018-09-18T20:11:23Z
dc.date.available	2018-09-18T20:11:23Z
dc.date.issued	2009
dc.identifier.issn	0955-792X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/137403
dc.description.abstract	We study the enumerability of families relative to the enumeration degrees. It is shown that if a family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerable (c.e). On the another hand, we will find a non-c.e. family which is e-reducible to all non-zero e-degree. This allows to construct a model, whose (extended) degree spectrum coincides with the non-zero e-degrees.
dc.relation.ispartofseries	Journal of Logic and Computation
dc.subject	C.e. Families
dc.subject	Degree spectra of models
dc.subject	E-degrees (enumeration degrees)
dc.subject	Turing degrees
dc.title	Enumeration degrees and enumerability of familes
dc.type	Conference Paper
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	19
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	151
dc.source.id	SCOPUS0955792X-2009-19-1-SID59449110343

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

Размер: 43.32Kb

Формат: PDF

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