The Wadge order on the Scott domain is not a well-quasi-order
DOI10.1017/JSL.2019.51zbMATH Open1477.03186arXiv1902.09419OpenAlexW2970858156WikidataQ127323589 ScholiaQ127323589MaRDI QIDQ5107232FDOQ5107232
Authors: Jacques Duparc, Louis Vuilleumier
Publication date: 17 April 2020
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.09419
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Continuous Lattices and Domains
- Data Types as Lattices
- Non-Hausdorff topology and domain theory. Selected topics in point-set topology
- Labeled posets are universal
- Continuous reducibility and dimension of metric spaces
- Quasi-Polish spaces
- Wadge degrees and pointclasses. Introduction to Part III
- Borel subsets of the real line and continuous reducibility
- A Wadge hierarchy for second countable spaces
- Wadge hardness in Scott spaces and its effectivization
- Wadge-like reducibilities on arbitrary quasi-Polish spaces
- Towards a descriptive set theory for domain-like structures
- Title not available (Why is that?)
- Wadge hierarchy and Veblen hierarchy. I: Borel sets of finite rank
- Title not available (Why is that?)
- Hierarchies in?-spaces and applications
- Extending Wadge theory to \(k\)-partitions
- Title not available (Why is that?)
- Early investigations of the degrees of Borel sets
- The SLO principle and the Wadge hierarchy
- Towards a descriptive theory of cb\(_{0}\)-spaces
- On the structure of the Wadge degrees of bqo-valued Borel functions
- Some notes on the universality of three-orders on finite labeled posets.
Cited In (6)
- Boole vs Wadge: comparing two basic tools of descriptive set theory
- A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
- Non-collapse of the effective Wadge hierarchy
- Wadge hardness in Scott spaces and its effectivization
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Input-driven pushdown automata on well-nested infinite strings
This page was built for publication: The Wadge order on the Scott domain is not a well-quasi-order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5107232)