Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies

dc.contributor.author	Bazhenov N.A.
dc.contributor.author	Mustafa M.
dc.contributor.author	San Mauro L.
dc.contributor.author	Yamaleev M.M.
dc.date.accessioned	2021-02-26T20:45:03Z
dc.date.available	2021-02-26T20:45:03Z
dc.date.issued	2020
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/163152
dc.description.abstract	© 2020, Pleiades Publishing, Ltd. Abstract: A standard tool for classifying the complexity of equivalence relations on ω is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which (Formula presented.), where α ≥ 2 is a computable ordinal and n is a non-zero natural number. We prove that there are infinitely many pairwise incomparable minimal equivalence relations that are properly in Γ.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	analytical hierarchy
dc.subject	computable reducibility
dc.subject	equivalence relation
dc.subject	hyperarithmetical hierarchy
dc.subject	minimal degree
dc.title	Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies
dc.type	Article
dc.relation.ispartofseries-issue	2
dc.relation.ispartofseries-volume	41
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	145
dc.source.id	SCOPUS19950802-2020-41-2-SID85087878058

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

Имя: SCOPUS19950802-20 ...

Размер: 362.7Kb

Формат: PDF

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