## Dr. Philipp Schlicht

## Articles

- The exact strength of the class forcing theorem submitted 2017
- Automatic learning from repetitive texts accepted for Algorithmic Learning Theory 2017
- A hierarchy of Ramsey-like cardinals submitted 2017
- Measurable cardinals and good Sigma_1(kappa)-wellorderings submitted 2017
- The recognizability strength of infinite time Turing machines with ordinal parameters accepted for Proceedings of Computability in Europe 2017
- Sufficient conditions for the forcing theorem, and turning proper classes into sets submitted 2017
- Randomness via infinite computation and effective descriptive set theory submitted 2016
- Perfect subsets of generalized Baire spaces and long games, accepted for Journal of Symbolic Logic
- Characterizations of pretameness and the Ord-cc accepted for Annals of Pure and Applied Logic
- Continuous reducibility and dimension of metric spaces, accepted for Archive for Mathematical Logic
- Sigma_1(kappa)-definable subsets of H(kappa^+) accepted for Journal of Symbolic Logic
- Borel subsets of the real line and continuous reducibility submitted 2016
- Recognizable sets and Woodin cardinals: Computation beyond the constructible universe submitted 2015
- Choiceless Ramsey Theory for Linear Orders appeared in Order
- Class forcing, the forcing theorem, and boolean completions appeared in Journal of Symbolic Logic
- Pumping for ordinal automatic structures appeared in Computability
- The Hurewicz dichotomy for generalized Baire spaces appeared in Israel Journal of Mathematics
- Infinite computations with random oracles appeared in Notre Dame Journal of Formal Logic, 2017
- Generalized Choquet spaces appeared in Fundamenta Mathematicae, 2016
- Tree-automatic scattered linear orders with Sanjay Jain, Bakhadyr Khoussainov, and Frank Stephan, Theoretical Computer Science 626 (2016), 83-96
- Continuous images of closed sets in generalized Baire spaces Israel Journal of Mathematics, 1 (2015), 421-461
- Wadge-like reducibilities in arbitrary quasi-Polish spaces Mathematical Structures in Computer Science 25 (2015), 8, 1705-1754
- Lipschitz and uniformly continuous reducibilities on ultrametric Polish spaces Logic, computation, hierarchies, 213-258, Ontos Mathematical Logic 4, De Gruyter, Berlin (2014)
- Thin equivalence relations and inner models Annals of Pure and Applied Logic 165 (2014), 10, 1577-1625 The results in Section 3.2 are only proved for forcings which are additionaly ccc in every inner model, as noticed by Ralf Schindler.
- Automata on ordinals and automaticity of linear orders Annals of Pure and Applied Logic (2013), no. 5, 523-527
- A minimal Prikry-type forcing for singularizing a measurable cardinal Journal of Symbolic Logic. Volume 78, 1 (2013), 85-100.
- Tree representations via ordinal machines Computablility 1, 1 (2012), 45-57
- Non-isomorphism invariant Borel quantifiers Proc. of the Amer. Math. Soc. 139 (2011), 4487-4496
- Thin equivalence relations in scaled pointclasses Mathematical Logic Quarterly 57, 6 (2011), 615-620

## Conference articles

- Structures without scattered-automatic presentation Computability in Europe 2013
- The mate-in-n problem of infinite chess is decidable How the world computes, Turing Centenary Conference 2012, LNCS 7318, 78-88
- Automata on ordinals and linear orders with Frank Stephan, LNCS 6735 (2011), 252-259

## Unpublished notes

## Dissertation

- Thin equivalence relations in L(R) and inner models (doctoral dissertation, 2008), available here

## Recent conference invitations

- 14th Atelier international de theorie des emsembles, CIRM Marseille, October 09-13, 2017
- Descriptive set theory in Turin, September 06-08, 2017
- Arbeitstreffen Computability Hiddensee, August 07-11, 2017

## Awards

- Marie Sklodowska-Curie Actions Seal of Excellence 2017
- Biennial award for best dissertation, Deutsche Vereinigung für mathematische Logik und Grundlagenforschung 2009