The rice-shapiro theorem in computable topology Full article
| Journal |
Logical Methods in Computer Science
ISSN: 1860-5974 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2017, Volume: 13, Number: 4, Article number : 30, Pages count : DOI: 10.23638/LMCS-13(4:30)2017 | ||||
| Tags | Computable elements; Computable topology; The rice-shapiro theorem | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
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.
Cite:
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
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
Identifiers:
| Web of science: | WOS:000419167900024 |
| Scopus: | 2-s2.0-85041822610 |
| OpenAlex: | W2753656839 |