Fine hierarchies via Priestley duality

DOI10.1016/J.APAL.2011.12.029zbMATH Open1247.03094OpenAlexW2003031003MaRDI QIDQ424549FDOQ424549

Authors: Victor Selivanov 

Publication date: 1 June 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2011.12.029

Recommendations

• Fine hierarchies and m-reducibilities in theoretical computer science
• Fine hierarchies and Boolean terms
• scientific article; zbMATH DE number 3851066
• scientific article
• Priestley-type dualities for partially ordered structures

zbMATH Keywords

hierarchyPriestley spaceStone space\(k\)-partition\(m\)-reducibilityalternating tree

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Other degrees and reducibilities in computability and recursion theory (03D30) Preorders, orders, domains and lattices (viewed as categories) (18B35) Lattices and duality (06D50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Representation of Distributive Lattices by means of ordered Stone Spaces
• The Theory of Representation for Boolean Algebras
• Title not available (Why is that?)
• Applications of the Theory of Boolean Rings to General Topology
• The difference and truth-table hierarchies for NP
• Title not available (Why is that?)
• Hierarchies and reducibilities on regular languages related to modulo counting
• Title not available (Why is that?)
• Efficient algorithms for membership in Boolean hierarchies of regular languages
• Title not available (Why is that?)
• Labeled posets are universal
• The theory of well-quasi-ordering: a frequently discovered concept
• Topology and descriptive set theory
• Descending chains and antichains of the unary, linear, and monotone subfunction relations
• Fine hierarchy of regular \(\omega\)-languages
• NP-partitions over posets with an application to reducing the set of solutions of NP problems
• A reducibility for the dot-depth hierarchy
• A note on parallel queries and the symmetric-difference hierarchy.
• A Fine Hierarchy of ω-Regular k-Partitions
• FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
• On ω-regular sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fine hierarchies and Boolean terms
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II
• Title not available (Why is that?)
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hierarchies of hyperarithmetical sets and functions
• The Boolean hierarchy of NP-partitions
• Fine hierarchies and m-reducibilities in theoretical computer science

Cited In (12)

• Effective wadge hierarchy in computable quasi-Polish spaces
• Title not available (Why is that?)
• A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
• Title not available (Why is that?)
• Duality, non-standard elements, and dynamic properties of r.e. sets
• Towards a descriptive theory of cb₀-spaces
• Non-collapse of the effective Wadge hierarchy
• Well-Quasi Orders and Hierarchy Theory
• A Fine Hierarchy of ω-Regular k-Partitions
• Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
• Extending Wadge theory to \(k\)-partitions
• Non-collapse of the effective wadge hierarchy

This page was built for publication: Fine hierarchies via Priestley duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424549)