Fine hierarchies and Boolean terms
From MaRDI portal
Publication:4836056
DOI10.2307/2275522zbMath0824.03022OpenAlexW2049227211MaRDI QIDQ4836056
Publication date: 31 October 1995
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275522
Descriptive set theory (03E15) Complexity of computation (including implicit computational complexity) (03D15) Hierarchies of computability and definability (03D55)
Related Items
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies ⋮ Towards a descriptive set theory for domain-like structures ⋮ A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ Fine hierarchy of regular ω-languages ⋮ Turing reducibility in the fine hierarchy ⋮ A syntactic approach to Borel functions: some extensions of Louveau's theorem ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ The Shrinking Property for NP and coNP ⋮ The shrinking property for NP and coNP ⋮ On the main scientific achievements of Victor Selivanov ⋮ Logic vs topology on regular \(\omega \)-languages ⋮ Fine hierarchies via Priestley duality ⋮ Unnamed Item ⋮ On the structure of the Wadge degrees of bqo-valued Borel functions ⋮ FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Turing degrees in refinements of the arithmetical hierarchy ⋮ 1999 European Summer Meeting of the Association for Symbolic Logic ⋮ Precomplete numberings ⋮ Facets of Synthesis: Revisiting Church’s Problem ⋮ Normalized information distance and the oscillation hierarchy ⋮ Wadge Degrees ofω-Languages of Deterministic Turing Machines ⋮ A reducibility for the dot-depth hierarchy ⋮ Boole vs Wadge: comparing two basic tools of descriptive set theory
Cites Work
