scientific article; zbMATH DE number 3609660
From MaRDI portal
Publication:4175553
zbMATH Open0393.03037MaRDI QIDQ4175553FDOQ4175553
Authors: Robert A. Van Wesep 
Publication date: 1978
Title of this publication is not available (Why is that?)
Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30) Determinacy principles (03E60)
Cited In (30)
- Boole vs Wadge: comparing two basic tools of descriptive set theory
- Hod mice and the mouse set conjecture
- The axiom of determinacy and the modern development of descriptive set theory
- Towards a descriptive theory of cb\(_{0}\)-spaces
- Every zero-dimensional homogeneous space is strongly homogeneous under determinacy
- The uniform Martin's conjecture for many-one degrees
- Game characterizations and lower cones in the Weihrauch degrees
- Fine hierarchy of regular \(\omega\)-languages
- Homogeneous Borel Sets
- Game characterizations and lower cones in the Weihrauch degrees
- A multiplication operation for the hierarchy of norms
- Wadge Degrees ofω-Languages of Deterministic Turing Machines
- Fine hierarchies and m-reducibilities in theoretical computer science
- Maps of Borel sets
- A tentative approach for the Wadge-Wagner hierarchy of regular tree languages of index \([0,2]\)
- A Property Equivalent to the Existence of Scales
- A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
- The size of the class of countable sequences of ordinals
- A Technique for Proving Uniformity
- Descriptive set theory, from Cantor to Wadge and beyond
- On the structure of the Wadge degrees of bqo-valued Borel functions
- Two Consequences of Determinacy Consistent with Choice
- Degrees of infinite words, polynomials and atoms
- Topological reducibilities for discontinuous functions and their structures
- Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
- Well-Quasi Orders and Hierarchy Theory
- A Lipschitz determinacy principle equivalent to weak König lemma
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
- Extending Wadge theory to \(k\)-partitions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175553)
