Name
Abstract | ||
|---|---|---|
In the framework of effectively enumerable topological spaces, we investigate the following question: given an effectively enumerable topological space whether there exists a computable numbering of all its computable elements. We present a natural sufficient condition on the family of basic neighborhoods of computable elements that guarantees the existence of a principal computable numbering. We show that weakly-effective omega-continuous domains and the natural numbers with the discrete topology satisfy this condition. We prove weak and strong analogues of Rice's theorem for computable elements. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-20028-6_23 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Fréchet space,Numbering,Discrete mathematics,Combinatorics,Open mapping theorem (functional analysis),Topological space,Topological vector space,Rice's theorem,Closed graph theorem,Locally convex topological vector space,Mathematics | Conference | 9136 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Margarita V. Korovina | 1 | 84 | 15.61 |
| Oleg V. Kudinov | 2 | 105 | 15.85 |