The following pages link to Descriptive set theory (Q1139038):
Displaying 50 items.
- Monotone operators and first category sets (Q270055) (← links)
- Beurling moving averages and approximate homomorphisms (Q297968) (← links)
- Game semantics for non-monotonic intensional logic programming (Q345702) (← links)
- A combinatorial property of Fréchet iterated filters (Q411828) (← links)
- Scales of minimal complexity in \({K(\mathbb{R})}\) (Q412055) (← links)
- Closed choice and a uniform low basis theorem (Q424541) (← links)
- A partially non-proper ordinal beyond \(L(V_{\lambda +1})\) (Q435204) (← links)
- Uniquely universal sets (Q439301) (← links)
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle (Q450961) (← links)
- Sets and supersets (Q513990) (← links)
- Descriptive classes of sets in nonseparable spaces (Q549572) (← links)
- Decidability and definability with circumscription (Q579240) (← links)
- Computational inductive definability (Q598276) (← links)
- The shrinking property for NP and coNP (Q627189) (← links)
- A game-theoretic characterization of Boolean grammars (Q631778) (← links)
- Totally non-proper ordinals beyond \(L(V_{\lambda +1})\) (Q634770) (← links)
- Beyond Borel-amenability: scales and superamenable reducibilities (Q636323) (← links)
- The effective theory of Borel equivalence relations (Q636325) (← links)
- Forcing absoluteness and regularity properties (Q636331) (← links)
- Higher Kurtz randomness (Q636362) (← links)
- The determinacy strength of \(\Pi_2^1\)-comprehension (Q636381) (← links)
- Kuratowski reduction in a \(\sigma \)-frame (Q639714) (← links)
- Graphs with \(\boldsymbol\Pi^ 0_ 1(\kappa)\) \(Y\)-sections (Q688509) (← links)
- On analytic and coanalytic function spaces \(C_ p(X)\) (Q690254) (← links)
- The isomorphism relation between tree-automatic structures (Q707994) (← links)
- Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
- Axioms of determinacy and biorthogonal systems (Q748820) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- A probabilistic dynamic logic (Q792757) (← links)
- Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games) (Q805613) (← links)
- The pointwise view of determinacy: arboreal forcings, measurability, and weak measurability (Q812501) (← links)
- Comparing inductive and circular definitions: Parameters, complexity and games (Q817681) (← links)
- The Hausdorff-Ershov hierarchy in Euclidean spaces (Q818930) (← links)
- The strength of Menger's conjecture (Q820693) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- On minimal non-potentially closed subsets of the plane (Q857052) (← links)
- Genericity and amalgamation of classes of Banach spaces (Q868918) (← links)
- A covering lemma for \(K(\mathbb{R})\) (Q877257) (← links)
- Counterexamples to countable-section \(\varPi_2^1\) uniformization and \(\varPi_3^1\) separation (Q904147) (← links)
- The natural semidirect product \({\mathbb{R}^n \rtimes G(n)}\) is algebraically determined (Q906505) (← links)
- Measurable, nonleavable gambling problems (Q909338) (← links)
- Baire irresolvable spaces and lifting for a layered ideal (Q910036) (← links)
- Large cardinals imply that every reasonably definable set of reals is Lebesgue measurable (Q917547) (← links)
- Partition properties and well-ordered sequences (Q922539) (← links)
- Projective subsets of separable metric spaces (Q923080) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- Lowness of higher randomness notions (Q948873) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Effectively closed sets of measures and randomness (Q958494) (← links)
- Regular variation without limits (Q984785) (← links)
