Towards a descriptive set theory for domain-like structures

DOI10.1016/j.tcs.2006.07.053zbMath1108.03050OpenAlexW1967960259MaRDI QIDQ854185

Victor L. Selivanov

Publication date: 7 December 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.053

zbMATH Keywords

surveyPolish spaceBorel hierarchyalgebraic domaindifference hierarchyWadge reducibility\(\omega\)-Boolean operation\(\varphi\)-spaceeffective space

Mathematics Subject Classification ID

Descriptive set theory (03E15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Lower separation axioms ((T_0)--(T_3), etc.) (54D10) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Continuous lattices and posets, applications (06B35) Theory of numerations, effectively presented structures (03D45)

Related Items

Unnamed Item, On the Lattices of Effectively Open Sets, Towards the Effective Descriptive Set Theory, A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES, Effective wadge hierarchy in computable quasi-Polish spaces, Strong computable type, Towards a descriptive theory of cb₀-spaces, On some results related to sober spaces, THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, Structural, point-free, non-Hausdorff topological realization of Borel groupoid actions, Well-Quasi Orders and Hierarchy Theory, A Wadge hierarchy for second countable spaces, Fine hierarchies and m-reducibilities in theoretical computer science, On the Difference Hierarchy in Countably Based T0-Spaces, On the Wadge Reducibility of k-Partitions, Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization, Wadge hardness in Scott spaces and its effectivization, Some hierarchies of QCB₀-spaces, On higher effective descriptive set theory, Base-complexity classifications of qcb0-spaces1, A generalization of a theorem of Hurewicz for quasi-Polish spaces, On the Wadge reducibility of \(k\)-partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hausdorff-Ershov hierarchy in Euclidean spaces
• Structure of degrees of generalized index sets
• Index sets in the hyperarithmetical hierarchy
• Fine hierarchy of regular \(\omega\)-languages
• Descriptive set theory
• Structures of the degrees of unsolvability of index sets
• Chain properties in Pomega
• \(X\)-automata on \(\omega\)-words
• The theory of A-spaces
• Some remarks about classes of recursively enumerable sets
• Topology and descriptive set theory
• A hierarchy of deterministic context-free \(\omega\)-languages.
• Effective metric spaces and representations of the reals.
• Computability on computable metric spaces
• Computable functionals of finite types
• Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
• Refinement is complete for implementations
• Effective Borel measurability and reducibility of functions
• Hierarchies in?-spaces and applications
• On the quasi-ordering of Borel linear orders under embeddability
• FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
• Extensional Characterization of Index Sets
• On ω-regular sets
• Theorie der Numerierungen I
• On effective topological spaces
• Wadge Degrees ofω-Languages of Deterministic Turing Machines
• Memoir on the Analytical Operations and Projective Sets (I)
• Compact metric spaces as minimal-limit sets in domains of bottomed sequences
• Index sets in Ershov's hierarchy
• Continuous Lattices and Domains
• Approximate decidability in euclidean spaces
• A domain equation for refinement of partial systems
• Fine hierarchies and Boolean terms
• Fine hierarchy of regular ω-languages
• Classifying countable Boolean terms
• New Computational Paradigms