Boole vs Wadge: comparing two basic tools of descriptive set theory
From MaRDI portal
Publication:2104278
Recommendations
- Descriptive set theory and Boolean complexity theory
- A comparison of concepts from computable analysis and effective descriptive set theory
- Descriptive set theory, from Cantor to Wadge and beyond
- scientific article; zbMATH DE number 6010989
- Comparison of Boolean algebras
- scientific article; zbMATH DE number 4072877
- On the comparison of Boolean bases
- Boolean and distributive ordered sets: Characterization and representation by sets
- scientific article; zbMATH DE number 2154574
- Boolos on the justification of set theory
Cites work
- A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
- A Wadge hierarchy for second countable spaces
- Classifying countable Boolean terms
- Effective wadge hierarchy in computable quasi-Polish spaces
- Fine hierarchies and Boolean terms
- Hierarchies in?-spaces and applications
- scientific article; zbMATH DE number 3849219 (Why is no real title available?)
- scientific article; zbMATH DE number 3609660 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 3109568 (Why is no real title available?)
- Memoir on the Analytical Operations and Projective Sets (I)
- Non-collapse of the effective wadge hierarchy
- On the structure of the Wadge degrees of bqo-valued Borel functions
- Quasi-Polish spaces
- The Wadge order on the Scott domain is not a well-quasi-order
- Total representations
- Towards a descriptive theory of cb\(_{0}\)-spaces
- Variations of Wadge reducibility
Cited in
(2)
This page was built for publication: Boole vs Wadge: comparing two basic tools of descriptive set theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104278)