Towards a descriptive set theory for domain-like structures

Authors:
Victor L. Selivanov
Affiliations:
Siberian Division of the Russian Academy of Sciences, A.P. Ershov Institute of Informatics Systems, Russian Federation
Venue:
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Year:
2006

Citing 18
Cited 3

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Computability on computable metric spaces

Theoretical Computer Science
X-automata on &ohgr;-words

Theoretical Computer Science
Mathematical theory of domains

Mathematical theory of domains
Fine hierarchies and Boolean terms

Journal of Symbolic Logic
Effective algebras

Handbook of logic in computer science (vol. 4)
Domain theory

Handbook of logic in computer science (vol. 3)
&ohgr;-languages

Handbook of formal languages, vol. 3
Fine hierarchy of regular &ohgr;-languages

Theoretical Computer Science
Computable analysis: an introduction

Computable analysis: an introduction
Effective metric spaces and representations of the reals

Theoretical Computer Science
Fine Hierarchy of Regular omega-Languages

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Fundamental study: a hierarchy of deterministic context-free ω-languages

Theoretical Computer Science
A domain equation for refinement of partial systems

Mathematical Structures in Computer Science
Compact metric spaces as minimal-limit sets in domains of bottomed sequences

Mathematical Structures in Computer Science
Refinement is complete for implementations

Formal Aspects of Computing
Borel ranks and wadge degrees of context free ω-languages

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms

On the Wadge Reducibility of k-Partitions

Electronic Notes in Theoretical Computer Science (ENTCS)
Fine hierarchies and m-reducibilities in theoretical computer science

Theoretical Computer Science
On the Difference Hierarchy in Countably Based T0-Spaces

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is a survey of results in descriptive set theory for domains and similar spaces, with the emphasis on the ω-algebraic domains. We try to demonstrate that the subject is interesting in its own right and is closely related to some areas of theoretical computer science. Since the subject is still in its beginning, we discuss in detail several open questions and possible future development. We also mention some relevant facts of (effective) descriptive set theory.