Name
Abstract | ||
|---|---|---|
We provide requirements on effectively enumerable T-0-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 effectively enumerable T-0-spaces where the Rice-Shapiro theorem does not hold. We propose two constructions that generate effectively enumerable T-0-spaces with particular properties from wn-families and computable trees without computable in finite paths. Using them we propose examples that give a flavor of this class. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.23638/LMCS-13(4:30)2017 | LOGICAL METHODS IN COMPUTER SCIENCE |
Keywords | DocType | Volume |
computable topology,computable elements,the Rice-Shapiro theorem | Journal | 13 |
Issue | ISSN | Citations |
4 | 1860-5974 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Margarita V. Korovina | 1 | 84 | 15.61 |
| Oleg V. Kudinov | 2 | 105 | 15.85 |