Descriptive set theory
From MaRDI portal
Publication:5322161
zbMATH Open1172.03026MaRDI QIDQ5322161FDOQ5322161
Authors: Yiannis N. Moschovakis 
Publication date: 20 July 2009
Recommendations
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Hierarchies of computability and definability (03D55) Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Recursive functions and relations, subrecursive hierarchies (03D20) Classification of real functions; Baire classification of sets and functions (26A21) Other set-theoretic hypotheses and axioms (03E65) Abstract and axiomatic computability and recursion theory (03D75) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60)
Cited In (only showing first 100 items - show all)
- Random geometric graphs and isometries of normed spaces
- Descriptive complexity of subsets of the space of finitely generated groups
- Equivalence of codes for countable sets of reals
- Turing degrees in Polish spaces and decomposability of Borel functions
- An undecidable extension of Morley's theorem on the number of countable models
- SHORTENING CLOPEN GAMES
- Linear orders: when embeddability and epimorphism agree
- Wadge-like degrees of Borel bqo-valued functions
- Effective wadge hierarchy in computable quasi-Polish spaces
- Classes of Polish spaces under effective Borel isomorphism
- Outline of partial computability in computable topology
- A characterization of \(\Sigma_1^1\)-reflecting ordinals
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Hyperarithmetical Sets
- A functional non-central limit theorem for multiple-stable processes with long-range dependence
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Title not available (Why is that?)
- Long Borel games
- VARIATIONS ON DETERMINACY AND ℵω1
- A syntactic approach to Borel functions: some extensions of Louveau's theorem
- On images of partial computable functions over computable Polish spaces
- The destruction of the axiom of determinacy by forcings on \(\mathbb{R}\) when \(\Theta\) is regular
- Determinacy and monotone inductive definitions
- Initial segment complexities of randomness notions
- CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
- CH, \(V = L\), disintegration of measures, and \(\Pi_1^1\) sets
- Limit theorems for long-memory flows on Wiener chaos
- Long games and \(\sigma \)-projective sets
- Maximal almost disjoint families, determinacy, and forcing
- Precomplete numberings
- Equivalence of generics
- Mice with finitely many Woodin cardinals from optimal determinacy hypotheses
- Countable ordinals in indiscernibility spectra
- Games and scales. Introduction to Part I
- On ⅁Γ-complete sets
- On the Reals Which Cannot Be Random
- \(\Sigma_1(\kappa)\)-definable subsets of \(\mathrm{H}(\kappa^+)\)
- DETERMINACY OF SCHMIDT’S GAME AND OTHER INTERSECTION GAMES
- CONSTRUCTING MAXIMAL COFINITARY GROUPS
- Non-collapse of the effective Wadge hierarchy
- Bisimilarity is not Borel
- Parallel feedback Turing computability
- Minimal controllability time for systems with nonlinear drift under a compact convex state constraint
- Forcing the Σ31-separation property
- Wadge-Wagner hierarchies
- The prehistory of the subsystems of second-order arithmetic
- Learning Theory and Descriptive Set Theory
- GAMES AND INDUCTION ON REALS
- A Galois connection between Turing jumps and limits
- Comparing the degrees of enumerability and the closed Medvedev degrees
- On the scope of the Effros theorem
- Projective games on the reals
- Universally Baire sets and generic absoluteness
- Non-collapse of the effective wadge hierarchy
- Every \(\Delta^0_2\) Polish space is computable topological
- Boundedness theorems for flowers and sharps
- A Fubini-type theorem for Hausdorff dimension
- Recursive Polish spaces
- Feedback computability on Cantor space
- Computability of Subsets of Metric Spaces
- Determinacy and regularity properties for idealized forcings
- Uniformity results on the Baire property
- The axiom of determinacy implies dependent choice in mice
- Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
- Title not available (Why is that?)
- Forcing the \(\Pi_3^1\)-reduction property and a failure of \(\Pi_3^1\)-uniformization
- COMPUTABLY COMPACT METRIC SPACES
- Strong computable type
- A reconstruction of Steel's multiverse project
- The ramified analytical hierarchy using extended logics
- A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
- The Continuum Hypothesis
- On the existence of small antichains for definable quasi-orders
- A Sacks indestructible co-analytic maximal eventually different family
- GAMES AND REFLECTION IN
- Iterated priority arguments in descriptive set theory
- Statures and sobrification ranks of Noetherian spaces
- Locally hyperarithmetical induction
- Effective aspects of Hausdorff and Fourier dimension
- Tall 𝐹_{𝜎} subideals of tall analytic ideals
- A characterization of bad approximability
- On reduction and separation of projective sets in Tychonoff spaces
- A proof of Grilliot's theorem
- An application of descriptive set theory to complex analysis
- There is no bound on Borel classes of graphs in the Luzin–Novikov theorem
- Polishness of some topologies related to word or tree automata
- A note on an effective Polish topology and Silver's dichotomy theorem
- A recursion theoretic characterization of the topological Vaught conjecture in the Zermelo-Fraenkel set theory
- Strongly unbounded and strongly dominating sets of reals generalized
- Title not available (Why is that?)
- The descriptive complexity of connectedness in Polish spaces
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Descriptive Borel sets
- Set theory and dynamical systems
- Random reals as measures of natural open sets
- A characterization of \(\omega \)-limit sets in subshifts of Baire space
- The envelope of a pointclass under a local determinacy hypothesis
- Lawvere-Tierney topologies for computability theorists
- Proof systems for infinite behaviours
- Polish group actions and effectivity
This page was built for publication: Descriptive set theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322161)
