The rice-shapiro theorem in computable topology | Sciact - Система учета научной деятельности ИМ СО РАН

The rice-shapiro theorem in computable topology Научная публикация

Журнал

Logical Methods in Computer Science
ISSN: 1860-5974

Вых. Данные

Год: 2017, Том: 13, Номер: 4, Номер статьи : 30, Страниц : DOI: 10.23638/LMCS-13(4:30)2017

Ключевые слова

Computable elements; Computable topology; The rice-shapiro theorem

Авторы

Korovina M. ¹ , Kudinov O. ²

Организации

1	A.P. Ershov Institute of Informatics Systems, SbRAS, Novosibirsk, Russian Federation
2	Sobolev Institute of Mathematics, SbRAS, Novosibirsk, Russian Federation

We provide requirements on effiectively enumerable T0-spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of effiectively enumerable T0-spaces where the Rice-Shapiro theorem does not hold. We propose two constructions that generate effiectively enumerable T0-spaces with particular properties from wn-families and computable trees without computable infinite paths. Using them we propose examples that give a flavor of this class. © M. Korovina and O. Kudinov.

Korovina M. , Kudinov O.
The rice-shapiro theorem in computable topology
Logical Methods in Computer Science. 2017. V.13. N4. 30 . DOI: 10.23638/LMCS-13(4:30)2017 WOS Scopus OpenAlex

Web of science:	WOS:000419167900024
Scopus:	2-s2.0-85041822610
OpenAlex:	W2753656839

БД	Цитирований
Scopus	5
OpenAlex	4
Web of science	5