On the Difference Hierarchy in Countably Based T0-Spaces

Authors:
Victor Selivanov
Affiliations:
A.P. Ershov Institute of Informatics Systems, Siberian Division Russian Academy of Sciences
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 5
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Domain theory

Handbook of logic in computer science (vol. 3)
Computable analysis: an introduction

Computable analysis: an introduction
Theory of Domains and Nearby (Invited Paper)

Proceedings of the International Conference on Formal Methods in Programming and Their Applications
Towards a descriptive set theory for domain-like structures

Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models

Quantified Score

Hi-index	0.00

Visualization

Abstract

We establish some results on some variants of the Hausdorff difference hierarchy. In particular, we extend the recently developed theory of difference hierarchy over the open sets in @w-algebraic domains to a similar theory for @w-continuous domains, and prove some analogs of the Hausdorff-Kuratowski theorem for k-partitions. We discuss also a broad class of effective topological spaces closely relevant to our study of the difference hierarchy and to computability in topology.