The following pages link to Philipp Schlicht (Q264573):
Displaying 40 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- The Hurewicz dichotomy for generalized Baire spaces (Q503280) (← links)
- Ordered semiautomatic rings with applications to geometry (Q782566) (← links)
- Continuous images of closed sets in generalized Baire spaces (Q891163) (← links)
- Choiceless Ramsey theory of linear orders (Q1686191) (← links)
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Continuous reducibility and dimension of metric spaces (Q1745355) (← links)
- Automata on ordinals and automaticity of linear orders (Q1944328) (← links)
- The recognizability strength of infinite time Turing machines with ordinal parameters (Q2011653) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- Lebesgue's density theorem and definable selectors for ideals (Q2164429) (← links)
- Thin equivalence relations and inner models (Q2250452) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- Infinite computations with random oracles (Q2364653) (← links)
- Characterizations of pretameness and the Ord-cc (Q2636530) (← links)
- Preserving levels of projective determinacy by tree forcings (Q2659097) (← links)
- Long games and \(\sigma \)-projective sets (Q2659104) (← links)
- Ideal topologies in higher descriptive set theory (Q2667997) (← links)
- Forcing axioms via ground model interpretations (Q2700805) (← links)
- Generalized Choquet spaces (Q2787125) (← links)
- The Mate-in-n Problem of Infinite Chess Is Decidable (Q2904396) (← links)
- CLASS FORCING, THE FORCING THEOREM AND BOOLEAN COMPLETIONS (Q2976344) (← links)
- Automata on Ordinals and Linear Orders (Q3091463) (← links)
- Non-isomorphism invariant Borel quantifiers (Q3104470) (← links)
- Thin equivalence relations in scaled pointclasses (Q3107345) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
- PERFECT SUBSETS OF GENERALIZED BAIRE SPACES AND LONG GAMES (Q4600457) (← links)
- Borel subsets of the real line and continuous reducibility (Q4615022) (← links)
- A minimal Prikry-type forcing for singularizing a measurable cardinal (Q4916545) (← links)
- Measurable cardinals and good ‐wellorderings (Q5109225) (← links)
- How to have more things by forgetting how to count them <sup /> (Q5161002) (← links)
- Σ<sub>1</sub>(<i>κ</i>)-DEFINABLE SUBSETS OF H(<i>κ</i><sup>+</sup>) (Q5359578) (← links)
- Sufficient conditions for the forcing theorem, and turning proper classes into sets (Q5376622) (← links)
- THE EXACT STRENGTH OF THE CLASS FORCING THEOREM (Q5855740) (← links)
- Uniformization and internal absoluteness (Q5889761) (← links)
- Generalized Polish spaces at regular uncountable cardinals (Q6139791) (← links)
- ASYMMETRIC CUT AND CHOOSE GAMES (Q6199175) (← links)
- Randomness via infinite computation and effective descriptive set theory (Q6280636) (← links)
- Measurable cardinals and good $\Sigma_1(\kappa)$-wellorderings (Q6285098) (← links)
- Uniformization and Internal Absoluteness (Q6375764) (← links)
