The Rice-Shapiro theorem in Computable Topology
We provide requirements on effectively enumerable topological 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 topological spaces where the Rice-Sha...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Logical Methods in Computer Science e.V.
2017-12-01
|
| Ráidu: | Logical Methods in Computer Science |
| Fáttát: | |
| Liŋkkat: | https://lmcs.episciences.org/4171/pdf |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|