Descriptive set theory
From MaRDI portal
(Redirected from Publication:5322161)
Descriptive set theory (scientific article; zbMATH DE number 5580633)
Descriptive set theory (scientific article; zbMATH DE number 5580633)
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20) Hierarchies of computability and definability (03D55) Abstract and axiomatic computability and recursion theory (03D75) Descriptive set theory (03E15) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60) Other set-theoretic hypotheses and axioms (03E65) Classification of real functions; Baire classification of sets and functions (26A21) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)
Recommendations
Cited in
(only showing first 100 items - show all)- Proof systems for infinite behaviours
- Recursively presented games and strategies
- \(\Pi_ 2^ 1\)-logic and uniformization in the analytical hierarchy
- Determinacy of refinements to the difference hierarchy of co-analytic sets
- Intuitionism and effective descriptive set theory
- Postclassical families of functions proper for descriptive and prescriptive spaces
- Computational capabilities of analog and evolving neural networks over infinite input streams
- Prior knowledge and monotone decision problems
- The descriptive complexity of the set of all closed zero-dimensional subsets of a Polish space
- On the elimination of imaginaries from certain valued fields
- OCA and automorphisms of \({\mathfrak P}(\omega)/\text{fin}\)
- Projective games on the reals
- Outline of partial computability in computable topology
- On higher effective descriptive set theory
- The destruction of the axiom of determinacy by forcings on \(\mathbb{R}\) when \(\Theta\) is regular
- Precomplete numberings
- Long Borel games
- Amenability, connected components, and definable actions
- Wadge-Wagner hierarchies
- Descriptive complexity of subsets of the space of finitely generated groups
- Degrees of non-computability of homeomorphism types of Polish spaces
- Non-collapse of the effective wadge hierarchy
- Descriptive set theory, from Cantor to Wadge and beyond
- Equivalence of generics
- Lebesgue's density theorem and definable selectors for ideals
- A functional non-central limit theorem for multiple-stable processes with long-range dependence
- 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)
- A complexity problem for Borel graphs
- Strong partition cardinals and determinacy in \(K(\mathbb R)\)
- Limit theorems for long-memory flows on Wiener chaos
- Comparing the degrees of enumerability and the closed Medvedev degrees
- Random reals as measures of natural open sets
- The envelope of a pointclass under a local determinacy hypothesis
- CH, \(V = L\), disintegration of measures, and \(\Pi_1^1\) sets
- First-order Gödel logics
- On images of partial computable functions over computable Polish spaces
- Analytic sets of reals and the density function in the Cantor space
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Properties of time-dependent statistical solutions of the three-dimensional Navier-Stokes equations
- Determinacy and monotone inductive definitions
- Initial segment complexities of randomness notions
- Long games and \(\sigma \)-projective sets
- A characterization of \(\omega \)-limit sets in subshifts of Baire space
- Effective wadge hierarchy in computable quasi-Polish spaces
- Minimal controllability time for systems with nonlinear drift under a compact convex state constraint
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- On the Reals Which Cannot Be Random
- scientific article; zbMATH DE number 4014700 (Why is no real title available?)
- Structural consequences of AD
- On the lattices of effectively open sets
- Towards the Effective Descriptive Set Theory
- scientific article; zbMATH DE number 7217020 (Why is no real title available?)
- \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
- The descriptive complexity of connectedness in Polish spaces
- Hyperarithmetical Sets
- scientific article; zbMATH DE number 4203251 (Why is no real title available?)
- Descriptive set theory over hyperfinite sets
- Formation and development of descriptive set theory. With a preface by K. Kuratowski
- Games and scales. Introduction to Part I
- Kleene’s Amazing Second Recursion Theorem
- Strongly dominating sets of reals
- scientific article; zbMATH DE number 4079421 (Why is no real title available?)
- scientific article; zbMATH DE number 38322 (Why is no real title available?)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Learning Theory and Descriptive Set Theory
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- Complexity of Ramsey null sets
- scientific article; zbMATH DE number 1166155 (Why is no real title available?)
- scientific article; zbMATH DE number 1959538 (Why is no real title available?)
- Groups, graphs, languages, automata, games and second-order monadic logic
- Polish group actions and effectivity
- A characterization of bad approximability
- Random geometric graphs and isometries of normed spaces
- A Galois connection between Turing jumps and limits
- Selective ultrafilters on FIN
- Universally Baire sets and generic absoluteness
- Set theory and dynamical systems
- scientific article; zbMATH DE number 218581 (Why is no real title available?)
- The ramified analytical hierarchy using extended logics
- Uniformity results on the Baire property
- CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
- Projective Measure Without Projective Baire
- Mice with finitely many Woodin cardinals from optimal determinacy hypotheses
- Realizing an \(\mathrm{AD}^+\) model as a derived model of a premouse
- Turing degrees in Polish spaces and decomposability of Borel functions
- Bounds on Scott ranks of some polish metric spaces
- A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
- SHORTENING CLOPEN GAMES
- GAMES AND INDUCTION ON REALS
- Computability of Subsets of Metric Spaces
- Definable towers
- The size of the class of countable sequences of ordinals
- Effective aspects of Hausdorff and Fourier dimension
- Non-collapse of the effective Wadge hierarchy
- There is no bound on Borel classes of graphs in the Luzin–Novikov theorem
- On reduction and separation of projective sets in Tychonoff spaces
- Maximal almost disjoint families, determinacy, and forcing
- Equivalence relations and determinacy
- VARIATIONS ON DETERMINACY AND ℵω1
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)
