scientific article; zbMATH DE number 5580633

Publication date: 20 July 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Borel set determinacy projective set measurable set

Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Inner models, including constructibility, ordinal definability, and core models (03E45) 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) Determinacy principles (03E60) Hierarchies of computability and definability (03D55) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (only showing first 100 items - show all)

The Continuum Hypothesis ⋮ Parallel Feedback Turing Computability ⋮ Countable ordinals in indiscernibility spectra ⋮ CONSTRUCTING MAXIMAL COFINITARY GROUPS ⋮ The Kℵ0$K^{\aleph _0}$ game: Vertex colouring ⋮ A syntactic approach to Borel functions: some extensions of Louveau's theorem ⋮ Strong computable type ⋮ Recursive Polish spaces ⋮ Determinacy and regularity properties for idealized forcings ⋮ THE DISCONTINUITY PROBLEM ⋮ Locally hyperarithmetical induction ⋮ Tall 𝐹_{𝜎} subideals of tall analytic ideals ⋮ An undecidable extension of Morley's theorem on the number of countable models ⋮ The axiom of determinacy implies dependent choice in mice ⋮ COUNTABLE LENGTH EVERYWHERE CLUB UNIFORMIZATION ⋮ Forcing the $\Pi_3^1$-reduction property and a failure of $\Pi_3^1$-uniformization ⋮ Σ₁(κ)-DEFINABLE SUBSETS OF H(κ⁺) ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Projective sets, intuitionistically ⋮ Classes of Polish spaces under effective Borel isomorphism ⋮ A game‐theoretic proof of Shelah's theorem on labeled trees ⋮ Iterates of $M_1$ ⋮ Unnamed Item ⋮ A Sacks indestructible co-analytic maximal eventually different family ⋮ Equivalence of codes for countable sets of reals ⋮ On the existence of small antichains for definable quasi-orders ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Choice free fixed point property in separable Banach spaces ⋮ Bisimilarity is not Borel ⋮ Polishness of some topologies related to word or tree automata ⋮ On ⅁Γ-complete sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Determined admissible sets ⋮ Linear orders: When embeddability and epimorphism agree ⋮ A note on an effective Polish topology and Silver’s dichotomy theorem ⋮ GAMES AND REFLECTION IN ⋮ PROVABLY GAMES ⋮ A RECONSTRUCTION OF STEEL’S MULTIVERSE PROJECT ⋮ Lawvere-Tierney topologies for computability theorists ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC ⋮ DETERMINACY OF SCHMIDT’S GAME AND OTHER INTERSECTION GAMES ⋮ CH, $V = L$, disintegration of measures, and $\Pi_1^1$ sets ⋮ The size of the class of countable sequences of ordinals ⋮ First-order Gödel logics ⋮ Unnamed Item ⋮ Determinacy and monotone inductive definitions ⋮ Uniformity results on the Baire property ⋮ Initial segment complexities of randomness notions ⋮ Effective aspects of Hausdorff and Fourier dimension ⋮ Non-collapse of the effective Wadge hierarchy ⋮ ${\Pi}_1^1$-Martin-Löf random reals as measures of natural open sets ⋮ On the Lattices of Effectively Open Sets ⋮ Equivalence of generics ⋮ There is no bound on Borel classes of graphs in the Luzin–Novikov theorem ⋮ On reduction and separation of projective sets in Tychonoff spaces ⋮ Towards the Effective Descriptive Set Theory ⋮ Lebesgue's density theorem and definable selectors for ideals ⋮ Maximal almost disjoint families, determinacy, and forcing ⋮ Equivalence relations and determinacy ⋮ VARIATIONS ON DETERMINACY AND ℵ_ω₁ ⋮ Long games and $\sigma $-projective sets ⋮ On images of partial computable functions over computable Polish spaces ⋮ A characterization of $\omega $-limit sets in subshifts of Baire space ⋮ Effective wadge hierarchy in computable quasi-Polish spaces ⋮ Boundedness theorems for flowers and sharps ⋮ Wadge-like degrees of Borel bqo-valued functions ⋮ Minimal controllability time for systems with nonlinear drift under a compact convex state constraint ⋮ Strongly dominating sets of reals ⋮ A characterization of bad approximability ⋮ On the scope of the Effros theorem ⋮ Determinacy of refinements to the difference hierarchy of co-analytic sets ⋮ Random geometric graphs and isometries of normed spaces ⋮ Forcing the Σ31-separation property ⋮ Souslin quasi-orders and bi-embeddability of uncountable structures ⋮ Analytic sets of reals and the density function in the Cantor space ⋮ Strongly unbounded and strongly dominating sets of reals generalized ⋮ Selective ultrafilters on FIN ⋮ Intuitionism and effective descriptive set theory ⋮ THE CONSISTENCY STRENGTH OF LONG PROJECTIVE DETERMINACY ⋮ A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory ⋮ Descriptive complexity of $\mathsf{qc} \mathsf{b}_0$-spaces ⋮ Π11‐Martin‐Löf randomness and Π11‐Solovay completeness ⋮ A functional non-central limit theorem for multiple-stable processes with long-range dependence ⋮ UNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Complexity of Ramsey null sets ⋮ On the Reals Which Cannot Be Random ⋮ Classical descriptive set theory as a refinement of effective descriptive set theory ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Computational capabilities of analog and evolving neural networks over infinite input streams ⋮ Prior knowledge and monotone decision problems ⋮ Polish group actions and effectivity ⋮ The descriptive complexity of connectedness in Polish spaces ⋮ 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 ⋮ Games for the $\mu$-calculus ⋮ Projective games on the reals

This page was built for publication: