Descriptive set theory
From MaRDI portal
Publication:5322161
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Universally Baire sets and generic absoluteness
- A note on an effective Polish topology and Silver's dichotomy theorem
- Strongly unbounded and strongly dominating sets of reals generalized
- A recursion theoretic characterization of the topological Vaught conjecture in the Zermelo-Fraenkel set theory
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Random geometric graphs and isometries of normed spaces
- The descriptive complexity of connectedness in Polish spaces
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- Boundedness theorems for flowers and sharps
- Every \(\Delta^0_2\) Polish space is computable topological
- Descriptive Borel sets
- Random reals as measures of natural open sets
- Set theory and dynamical systems
- A characterization of \(\omega \)-limit sets in subshifts of Baire space
- Descriptive complexity of subsets of the space of finitely generated groups
- The envelope of a pointclass under a local determinacy hypothesis
- Proof systems for infinite behaviours
- A Fubini-type theorem for Hausdorff dimension
- Polish group actions and effectivity
- scientific article; zbMATH DE number 38322 (Why is no real title available?)
- Lawvere-Tierney topologies for computability theorists
- Recursive Polish spaces
- Equivalence of codes for countable sets of reals
- OCA and automorphisms of \({\mathfrak P}(\omega)/\text{fin}\)
- Amenability, connected components, and definable actions
- \(\Pi_ 2^ 1\)-logic and uniformization in the analytical hierarchy
- Feedback computability on Cantor space
- Turing degrees in Polish spaces and decomposability of Borel functions
- Computability of Subsets of Metric Spaces
- An undecidable extension of Morley's theorem on the number of countable models
- SHORTENING CLOPEN GAMES
- Iterates of \(M_1\)
- Linear orders: when embeddability and epimorphism agree
- Determinacy and regularity properties for idealized forcings
- Wadge-like degrees of Borel bqo-valued functions
- Uniformity results on the Baire property
- A diamond-plus principle consistent with AD
- On higher effective descriptive set theory
- The axiom of determinacy implies dependent choice in mice
- Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
- scientific article; zbMATH DE number 7204368 (Why is no real title available?)
- Effective wadge hierarchy in computable quasi-Polish spaces
- Outline of partial computability in computable topology
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- The Kℵ0$K^{\aleph _0}$ game: Vertex colouring
- Classes of Polish spaces under effective Borel isomorphism
- 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
- scientific article; zbMATH DE number 4079421 (Why is no real title available?)
- A functional non-central limit theorem for multiple-stable processes with long-range dependence
- Structural consequences of AD
- Forcing the \(\Pi_3^1\)-reduction property and a failure of \(\Pi_3^1\)-uniformization
- Choice free fixed point property in separable Banach spaces
- scientific article; zbMATH DE number 4014700 (Why is no real title available?)
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Complexity of Ramsey null sets
- Bounds on Scott ranks of some polish metric spaces
- Degrees of non-computability of homeomorphism types of Polish spaces
- Long Borel games
- The Dyck and the Preiss separation uniformly
- VARIATIONS ON DETERMINACY AND ℵω1
- Kleene’s Amazing Second Recursion Theorem
- On images of partial computable functions over computable Polish spaces
- A syntactic approach to Borel functions: some extensions of Louveau's theorem
- The destruction of the axiom of determinacy by forcings on \(\mathbb{R}\) when \(\Theta\) is regular
- COMPUTABLY COMPACT METRIC SPACES
- Determinacy and monotone inductive definitions
- Initial segment complexities of randomness notions
- Equivalence relations and determinacy
- Groups, graphs, languages, automata, games and second-order monadic logic
- CH, \(V = L\), disintegration of measures, and \(\Pi_1^1\) sets
- Limit theorems for long-memory flows on Wiener chaos
- Souslin quasi-orders and bi-embeddability of uncountable structures
- scientific article; zbMATH DE number 7217020 (Why is no real title available?)
- Long games and \(\sigma \)-projective sets
- CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
- Maximal almost disjoint families, determinacy, and forcing
- Descriptive set theory over hyperfinite sets
- Definable towers
- Strong computable type
- Analytic sets of reals and the density function in the Cantor space
- Selective ultrafilters on FIN
- Precomplete numberings
- A reconstruction of Steel's multiverse project
- The ramified analytical hierarchy using extended logics
- Equivalence of generics
- A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
- Strong partition cardinals and determinacy in \(K(\mathbb R)\)
- Mice with finitely many Woodin cardinals from optimal determinacy hypotheses
- The Continuum Hypothesis
- A game-theoretic proof of Shelah's theorem on labeled trees
- On the existence of small antichains for definable quasi-orders
- Strongly dominating sets of reals
- Games and scales. Introduction to Part I
- Countable ordinals in indiscernibility spectra
- Properties of time-dependent statistical solutions of the three-dimensional Navier-Stokes equations
- Formation and development of descriptive set theory. With a preface by K. Kuratowski
- A Sacks indestructible co-analytic maximal eventually different family
- On ⅁Γ-complete sets
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)
