Fine hierarchies and Boolean terms
From MaRDI portal
Recommendations
Cites work
Cited in
(28)- Fine hierarchy of regular \(\omega\)-languages
- Turing degrees in refinements of the arithmetical hierarchy
- Precomplete numberings
- Normalized information distance and the oscillation hierarchy
- Boole vs Wadge: comparing two basic tools of descriptive set theory
- Turing reducibility in the fine hierarchy
- A reducibility for the dot-depth hierarchy
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Well-Quasi Orders and Hierarchy Theory
- The Shrinking Property for NP and coNP
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
- Facets of Synthesis: Revisiting Church’s Problem
- Fine hierarchies via Priestley duality
- Wadge Degrees ofω-Languages of Deterministic Turing Machines
- scientific article; zbMATH DE number 1534578 (Why is no real title available?)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
- 1999 European Summer Meeting of the Association for Symbolic Logic
- A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
- Fine hierarchy of regular -languages
- On the structure of the Wadge degrees of bqo-valued Borel functions
- A syntactic approach to Borel functions: some extensions of Louveau's theorem
- scientific article; zbMATH DE number 7770056 (Why is no real title available?)
- On the main scientific achievements of Victor Selivanov
- Logic vs topology on regular -languages
- The shrinking property for NP and coNP
- \(L_{\omega \omega }, L_{\omega_1\omega }\), and the Wadge hierarchy
- Towards a descriptive set theory for domain-like structures
- Fine hierarchies and m-reducibilities in theoretical computer science
This page was built for publication: Fine hierarchies and Boolean terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836056)