Separation principles in the hierarchies of classical and effective descriptive set theory
From MaRDI portal
Publication:3265770
DOI10.4064/fm-46-2-123-135zbMath0091.05201OpenAlexW883393071MaRDI QIDQ3265770
Publication date: 1959
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213497
Related Items
The axiom of determinateness and reduction principles in the analytical hierarchy ⋮ Some results in the effective descriptive set theory ⋮ Descriptive set theory, from Cantor to Wadge and beyond ⋮ Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic ⋮ Proof of a theorem of Lusin ⋮ Axiom of comparable choice and uniformizability of projective classes ⋮ Hierarchies of Effective Descriptive Set Theory ⋮ Kuratowski reduction in a \(\sigma \)-frame ⋮ Non-uniformizable sets with countable cross-sections on a given level of the projective hierarchy ⋮ On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$ ⋮ Factoring Solovay-random extensions, with application to the reduction property ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Hyperarithmetical Sets ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Topological complexity of graphs and their spanning trees ⋮ Computable numberings of families of infinite sets ⋮ On an effective hierarchy of communicating processes: Separation principle and testing ⋮ Kleene’s Amazing Second Recursion Theorem ⋮ Definable elements of definable Borel sets ⋮ Descriptive complexity of subsets of the space of finitely generated groups ⋮ La théorie des fonctions récursives et ses applications. (Exposé d'information générale) ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
