Hierarchies of Δ02‐measurable k ‐partitions
From MaRDI portal
Publication:5307611
DOI10.1002/malq.200710011zbMath1124.03021OpenAlexW1527238007MaRDI QIDQ5307611
Publication date: 17 September 2007
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200710011
difference hierarchyWadge reducibilityhomomorphic preorderBoolean hierarchy of \(k\)-partitionslevel-hierarchylimit-hierarchy
Related Items (22)
A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES ⋮ Wadge-like degrees of Borel bqo-valued functions ⋮ A syntactic approach to Borel functions: some extensions of Louveau's theorem ⋮ Definability of closure operations in the \(h\)-quasiorder of labeled forests ⋮ Towards a descriptive theory of cb0-spaces ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Fraïssé’s conjecture in Π11-comprehension ⋮ Closed choice and a uniform low basis theorem ⋮ Borel-Piecewise Continuous Reducibility for Uniformization Problems ⋮ On the structure of the Wadge degrees of bqo-valued Borel functions ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ On the Difference Hierarchy in Countably Based T0-Spaces ⋮ A Gandy Theorem for Abstract Structures and Applications to First-Order Definability ⋮ Wadge hardness in Scott spaces and its effectivization ⋮ Wadge-like reducibilities on arbitrary quasi-Polish spaces ⋮ Extending Wadge theory to \(k\)-partitions ⋮ The uniform Martin’s conjecture for many-one degrees ⋮ Definability in the Infix Order on Words ⋮ Complexity Issues for Preorders on Finite Labeled Forests ⋮ Definability in the \(h\)-quasiorder of labeled forests ⋮ On the Wadge reducibility of \(k\)-partitions
Cites Work
This page was built for publication: Hierarchies of Δ02‐measurable k ‐partitions
