The following pages link to Descriptive set theory (Q1139038):
Displaying 50 items.
- Effective metric spaces and representations of the reals. (Q1607294) (← links)
- On index of total boundedness of (strictly) \(o\)-bounded groups (Q1612187) (← links)
- On the classification of first order Gödel logics (Q1616771) (← links)
- Definability and almost disjoint families (Q1644959) (← links)
- Coding and definability in computable structures (Q1782235) (← links)
- On disjoint Borel uniformizations (Q1805831) (← links)
- Orbit cardinals: On the effective cardinalities arising as quotient spaces of the form \(X/G\) where \(G\) acts on a Polish space \(X\) (Q1806265) (← links)
- Some applications of positive formulas in descriptive set theory and logic (Q1812904) (← links)
- Turing determinacy and the continuum hypothesis (Q1824617) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- The real core model and its scales (Q1892098) (← links)
- Projectively well-ordered inner models (Q1892942) (← links)
- The consistency strength of projective absoluteness (Q1896614) (← links)
- Large cardinals and definable counterexamples to the continuum hypothesis (Q1902975) (← links)
- \(\Pi_ 1^ 1\) wellfounded relations (Q1903130) (← links)
- Compact covering and game determinacy (Q1910715) (← links)
- Observations about Scott and Karp trees (Q1919521) (← links)
- \(\Pi_ 2^ 1\) Wadge degrees (Q1919526) (← links)
- Polynomial games and determinacy (Q1919550) (← links)
- On the time complexity of partial real functions (Q1977153) (← links)
- Projective uniformization revisited (Q1977487) (← links)
- Randomising realizability (Q2117768) (← links)
- Parameterized games of perfect information (Q2177793) (← links)
- Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
- Thin equivalence relations and inner models (Q2250452) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- Separation of analytic sets by rectangles of low complexity (Q2254721) (← links)
- A dichotomy result for a pointwise summable sequence of operators (Q2271987) (← links)
- Classical and effective descriptive complexities of \(\omega \)-powers (Q2271988) (← links)
- Properties of stationary statistical solutions of the three-dimensional Navier-Stokes equations (Q2318474) (← links)
- Definable elements of definable Borel sets (Q2334907) (← links)
- Set theory and the analyst (Q2419681) (← links)
- Big vee: the story of a function, an algorithm, and three mathematical worlds (Q2431008) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- The distribution of ITRM-recognizable reals (Q2453067) (← links)
- Generalized doubling meets Poincaré (Q2459946) (← links)
- An infinite-game semantics for well-founded negation in logic programming (Q2474440) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- A random set characterization of possibility measures (Q2486016) (← links)
- Two simple sets that are not positively Borel (Q2488272) (← links)
- A global wellordering of norms defined via Blackwell games (Q2490425) (← links)
- Codings of separable compact subsets of the first Baire class (Q2501537) (← links)
- Canonical structure in the universe of set theory. II. (Q2503395) (← links)
- Borel extractions of converging sequences in compact sets of Borel functions (Q2518765) (← links)
- On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms (Q2568460) (← links)
- Bounds on Scott rank for various nonelementary classes (Q2639058) (← links)
- An extension of Borel determinacy (Q2640595) (← links)
- The full basis theorem does not imply analytic wellordering (Q2659101) (← links)