The following pages link to Descriptive set theory (Q1139038):
Displayed 50 items.
- 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)
- Decision problems for Turing machines (Q990079) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- Continuous Fraïssé conjecture (Q1013988) (← links)
- Projective absoluteness for Sacks forcing (Q1031831) (← links)
- Infinite combinatorics and the foundations of regular variation (Q1034572) (← links)
- The automorphism tower of a centerless group without choice (Q1042442) (← links)
- Determinacy implies that \(\aleph_ 2\) is supercompact (Q1055406) (← links)
- Regularity properties of definable sets of reals (Q1069930) (← links)
- The lack of definable witnesses and provably recursive functions in intuitionistic set theories (Q1071017) (← links)
- Infinite products in monoids (Q1080960) (← links)
- 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) (Q1083651) (← links)
- The axiom of determinacy and the modern development of descriptive set theory (Q1097880) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- On some extensions of the projective hierarchy (Q1099175) (← links)
- Approximating sets with equivalence relations (Q1099631) (← links)
- Selctive ultrafilters and homogeneity (Q1105590) (← links)
- Infinite combinatorics and definability (Q1117219) (← links)
- The Galvin-Prikry theorem and set existence axioms (Q1117221) (← links)
- Borel ideals vs. Borel sets of countable relations and trees (Q1120573) (← links)
- Fine hierarchy of regular \(\omega\)-languages (Q1127312) (← links)
- Dense selections (Q1166147) (← links)
- Three ordinal ranks for the set of differentiable functions (Q1176315) (← links)
- The complexity of antidifferentiation (Q1178488) (← links)
- Borel quasi-orderings in subsystems of second-order arithmetic (Q1182484) (← links)
- Compact perfect sets in weak analytic spaces (Q1183634) (← links)
- Fairness, distances and degrees (Q1193862) (← links)
- Determinacy and extended sharp functions on the reals. II: Obtaining sharps from determinacy (Q1194242) (← links)
- Amenability, Kazhdan's property and percolation for trees, groups and equivalence relations (Q1196320) (← links)
- Query languages for hierarchic databases (Q1201723) (← links)
- Logic, sets, and mathematics (Q1209798) (← links)
- Free distributive groupoids (Q1262396) (← links)