Descriptive set theory
From MaRDI portal
Publication:1139038
zbMath0433.03025MaRDI QIDQ1139038
Publication date: 1980
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
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 Hausdorff-Ershov hierarchy in Euclidean spaces ⋮ The strength of Menger's conjecture ⋮ Monotone operators and first category sets ⋮ Some descriptive-set-theoretical problems in complexity theory ⋮ Infinite products in monoids ⋮ Topology and descriptive set theory ⋮ Sur la génération des fonctions boréliennes fortement affines sur un convexe compact métrisable. (On the generation of strongly affine Borel functions on a metrizable convex compact set) ⋮ Computational depth and reducibility ⋮ Borel measurable selections of Paretian utility functions ⋮ On Borel ideals ⋮ Beurling moving averages and approximate homomorphisms ⋮ Large cardinal axioms and independence: The continuum problem revisited ⋮ Is Gold-Putnam diagonalization complete? ⋮ The axiom of determinacy and the modern development of descriptive set theory ⋮ Alternating automata on infinite trees ⋮ On some extensions of the projective hierarchy ⋮ Approximating sets with equivalence relations ⋮ Towards a descriptive set theory for domain-like structures ⋮ Selctive ultrafilters and homogeneity ⋮ On minimal non-potentially closed subsets of the plane ⋮ Mouse sets ⋮ Game semantics for non-monotonic intensional logic programming ⋮ Narrow coverings of \(\omega\)-ary product spaces ⋮ Genericity and amalgamation of classes of Banach spaces ⋮ Infinite combinatorics and definability ⋮ The Galvin-Prikry theorem and set existence axioms ⋮ Computational inductive definability ⋮ Borel ideals vs. Borel sets of countable relations and trees ⋮ A covering lemma for \(K(\mathbb{R})\) ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ Ambiguity in omega context free languages ⋮ A combinatorial property of Fréchet iterated filters ⋮ Scales of minimal complexity in \({K(\mathbb{R})}\) ⋮ A hierarchy of deterministic context-free \(\omega\)-languages. ⋮ Borel hierarchy and omega context free languages. ⋮ The shrinking property for NP and coNP ⋮ Closed choice and a uniform low basis theorem ⋮ Counterexamples to countable-section \(\varPi_2^1\) uniformization and \(\varPi_3^1\) separation ⋮ A game-theoretic characterization of Boolean grammars ⋮ Equivalence between Wadge and Lipschitz determinacy ⋮ The natural semidirect product \({\mathbb{R}^n \rtimes G(n)}\) is algebraically determined ⋮ Totally non-proper ordinals beyond \(L(V_{\lambda +1})\) ⋮ Beyond Borel-amenability: scales and superamenable reducibilities ⋮ The effective theory of Borel equivalence relations ⋮ Forcing absoluteness and regularity properties ⋮ Higher Kurtz randomness ⋮ The determinacy strength of \(\Pi_2^1\)-comprehension ⋮ A partially non-proper ordinal beyond \(L(V_{\lambda +1})\) ⋮ Measurable, nonleavable gambling problems ⋮ Baire irresolvable spaces and lifting for a layered ideal ⋮ Uniquely universal sets ⋮ Kuratowski reduction in a \(\sigma \)-frame ⋮ Comparing Peano arithmetic, Basic Law V, and Hume's Principle ⋮ Large cardinals imply that every reasonably definable set of reals is Lebesgue measurable ⋮ Dense selections ⋮ Partition properties and well-ordered sequences ⋮ Projective subsets of separable metric spaces ⋮ Three ordinal ranks for the set of differentiable functions ⋮ The complexity of antidifferentiation ⋮ Borel quasi-orderings in subsystems of second-order arithmetic ⋮ Compact perfect sets in weak analytic spaces ⋮ Topological complexity of locally finite \(\omega\)-languages ⋮ Lowness of higher randomness notions ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Fairness, distances and degrees ⋮ Determinacy and extended sharp functions on the reals. II: Obtaining sharps from determinacy ⋮ Sets and supersets ⋮ Amenability, Kazhdan's property and percolation for trees, groups and equivalence relations ⋮ Effectively closed sets of measures and randomness ⋮ Graphs with \(\boldsymbol\Pi^ 0_ 1(\kappa)\) \(Y\)-sections ⋮ Query languages for hierarchic databases ⋮ On analytic and coanalytic function spaces \(C_ p(X)\) ⋮ Logic, sets, and mathematics ⋮ Descriptive classes of sets in nonseparable spaces ⋮ The isomorphism relation between tree-automatic structures ⋮ Some new results on decidability for elementary algebra and geometry ⋮ Regular variation without limits ⋮ Decidability and definability with circumscription ⋮ Decision problems for Turing machines ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ Continuous Fraïssé conjecture ⋮ Free distributive groupoids ⋮ Axioms of determinacy and biorthogonal systems ⋮ Mass problems associated with effectively closed sets ⋮ Projective absoluteness for Sacks forcing ⋮ Infinite combinatorics and the foundations of regular variation ⋮ The automorphism tower of a centerless group without choice ⋮ On approximate and algebraic computability over the real numbers ⋮ Borel equivalence relations induced by actions of the symmetric group ⋮ Is there a set of reals not in \(K(\mathbb{R})\)? ⋮ Applications of cut-free infinitary derivations to generalized recursion theory ⋮ A probabilistic dynamic logic ⋮ Determinacy implies that \(\aleph_ 2\) is supercompact ⋮ Simply connected compact subsets of the plane ⋮ An application of Shoenfield's absoluteness theorem to the theory of uniform distribution ⋮ Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games) ⋮ Regularity properties of definable sets of reals ⋮ The lack of definable witnesses and provably recursive functions in intuitionistic set theories ⋮ The pointwise view of determinacy: arboreal forcings, measurability, and weak measurability ⋮ Comparing inductive and circular definitions: Parameters, complexity and games
This page was built for publication: Descriptive set theory
