Recommendations
Cites work
- scientific article; zbMATH DE number 1688391 (Why is no real title available?)
- scientific article; zbMATH DE number 3849219 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 1500515 (Why is no real title available?)
- scientific article; zbMATH DE number 1747443 (Why is no real title available?)
- scientific article; zbMATH DE number 1759433 (Why is no real title available?)
- scientific article; zbMATH DE number 2154085 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 6318 (Why is no real title available?)
- scientific article; zbMATH DE number 1396725 (Why is no real title available?)
- scientific article; zbMATH DE number 1414285 (Why is no real title available?)
- scientific article; zbMATH DE number 3216184 (Why is no real title available?)
- scientific article; zbMATH DE number 3264065 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3304085 (Why is no real title available?)
- scientific article; zbMATH DE number 3316891 (Why is no real title available?)
- scientific article; zbMATH DE number 3342830 (Why is no real title available?)
- scientific article; zbMATH DE number 3198011 (Why is no real title available?)
- A Fine Hierarchy of ω-Regular k-Partitions
- A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II
- A note on parallel queries and the symmetric-difference hierarchy.
- A reducibility for the dot-depth hierarchy
- Applications of the Theory of Boolean Rings to General Topology
- Descending chains and antichains of the unary, linear, and monotone subfunction relations
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
- Fine hierarchies and Boolean terms
- Fine hierarchies and m-reducibilities in theoretical computer science
- Fine hierarchy of regular \(\omega\)-languages
- Hierarchies and reducibilities on regular languages related to modulo counting
- Hierarchies of hyperarithmetical sets and functions
- Labeled posets are universal
- NP-partitions over posets with an application to reducing the set of solutions of NP problems
- On ω-regular sets
- Representation of Distributive Lattices by means of ordered Stone Spaces
- The Boolean hierarchy of NP-partitions
- The Theory of Representation for Boolean Algebras
- The difference and truth-table hierarchies for NP
- The theory of well-quasi-ordering: a frequently discovered concept
- Topology and descriptive set theory
- Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
Cited in
(12)- Effective wadge hierarchy in computable quasi-Polish spaces
- A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
- Non-collapse of the effective wadge hierarchy
- scientific article; zbMATH DE number 7770056 (Why is no real title available?)
- Non-collapse of the effective Wadge hierarchy
- scientific article; zbMATH DE number 1534578 (Why is no real title available?)
- Extending Wadge theory to \(k\)-partitions
- Well-Quasi Orders and Hierarchy Theory
- A Fine Hierarchy of ω-Regular k-Partitions
- Duality, non-standard elements, and dynamic properties of r.e. sets
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Towards a descriptive theory of cb\(_{0}\)-spaces
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)