Automata on Ordinals and Linear Orders. - Philipp Schlicht; Frank Stephan 001 (CiE, 2011)

Thin equivalence relations in scaled pointclasses. - Ralf Schindler; Philipp Schlicht (Math. Log. Q., 2011)

The Mate-in-n Problem of Infinite Chess Is Decidable. - Dan Brumleve; Joel David Hamkins; Philipp Schlicht (CiE, 2012)

Tree Representations via Ordinal Machines. - Philipp Schlicht; Benjamin Seyfferth (Comput., 2012)

Structures without Scattered-Automatic Presentation. - Alexander Kartzow; Philipp Schlicht (CiE, 2013)

Automata on ordinals and automaticity of linear orders. - Philipp Schlicht; Frank Stephan 001 (Ann. Pure Appl. Log., 2013)

A minimal Prikry-type forcing for singularizing a measurable cardinal. - Peter Koepke; Karen Räsch; Philipp Schlicht (J. Symb. Log., 2013)

Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces. - Luca Motto Ros; Philipp Schlicht (Logic, Computation, Hierarchies, 2014)

Thin equivalence relations and inner models. - Philipp Schlicht (Ann. Pure Appl. Log., 2014)

Wadge-like reducibilities on arbitrary quasi-Polish spaces. - Luca Motto Ros; Philipp Schlicht; Victor L. Selivanov (Math. Struct. Comput. Sci., 2015)

Class forcing, the forcing Theorem and Boolean Completions. - Peter Holy; Regula Krapf; Philipp Lücke; Ana Njegomir; Philipp Schlicht (J. Symb. Log., 2016)

Tree-automatic scattered linear orders. - Sanjay Jain 001; Bakhadyr Khoussainov; Philipp Schlicht; Frank Stephan 001 (Theor. Comput. Sci., 2016)

Automatic Learning from Repetitive Texts. - Rupert Hölzl 001; Sanjay Jain 001; Philipp Schlicht; Karen Seidel 001; Frank Stephan 001 (ALT, 2017)

The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. - Merlin Carl; Philipp Schlicht (CiE, 2017)

Pumping for ordinal-automatic structures. - Martin Huschenbett; Alexander Kartzow; Philipp Schlicht (Comput., 2017)

Σ1(κ)-DEFINABLE SUBSETS OF H(κ +). - Philipp Lücke; Ralf Schindler; Philipp Schlicht (J. Symb. Log., 2017)

Perfect Subsets of generalized Baire Spaces and Long Games. - Philipp Schlicht (J. Symb. Log., 2017)

Infinite Computations with Random Oracles. - Merlin Carl; Philipp Schlicht (Notre Dame J. Formal Log., 2017)

Choiceless Ramsey Theory of Linear Orders. - Philipp Lücke; Philipp Schlicht; Thilo Weinert (Order, 2017)

Continuous reducibility and dimension of metric spaces. - Philipp Schlicht (Arch. Math. Log., 2018)

Recognizable sets and Woodin cardinals: computation beyond the constructible universe. - Merlin Carl; Philipp Schlicht; Philip D. Welch (Ann. Pure Appl. Log., 2018)

Characterizations of pretameness and the Ord-cc. - Peter Holy; Regula Krapf; Philipp Schlicht (Ann. Pure Appl. Log., 2018)

Writability and reachability for alpha-tape infinite time Turing machines. - Merlin Carl; Benjamin G. Rin; Philipp Schlicht (CoRR, 2018)

Randomness via Infinite Computation and Effective Descriptive Set Theory. - Merlin Carl; Philipp Schlicht (J. Symb. Log., 2018)

Measurable cardinals and good -wellorderings. - Philipp Lücke; Philipp Schlicht (Math. Log. Q., 2018)

The isomorphism problem for tree-automatic ordinals with addition. - Sanjay Jain 001; Bakhadyr Khoussainov; Philipp Schlicht; Frank Stephan 001 (Inf. Process. Lett., 2019)

Ordered Semiautomatic Rings with Applications to Geometry. - Ziyuan Gao; Sanjay Jain 001; Ji Qi; Philipp Schlicht; Frank Stephan 001; Jacob Tarr (LATA, 2020)

Decision times of infinite computations. - Merlin Carl; Philipp Schlicht; Philip D. Welch (CoRR, 2020)

The exact strength of the class forcing Theorem. - Victoria Gitman; Joel David Hamkins; Peter Holy; Philipp Schlicht; Kameryn J. Williams (J. Symb. Log., 2020)

Reachability for infinite time Turing machines with long tapes. - Merlin Carl; Benjamin G. Rin; Philipp Schlicht (Log. Methods Comput. Sci., 2020)

Long games and σ-projective sets. - Juan P. Aguilera 001; Sandra Müller; Philipp Schlicht (Ann. Pure Appl. Log., 2021)

Preserving levels of projective determinacy by tree forcings. - Fabiana Castiblanco; Philipp Schlicht (Ann. Pure Appl. Log., 2021)

Ideal topologies in higher descriptive set theory. - Peter Holy; Marlene Koelbing; Philipp Schlicht; Wolfgang Wohofsky (Ann. Pure Appl. Log., 2022)

Coarse groups, and the isomorphism problem for oligomorphic groups. - André Nies; Philipp Schlicht; Katrin Tent (J. Math. Log., 2022)

Forcing axioms via ground model interpretations. - Christopher Henney-Turner; Philipp Schlicht (Ann. Pure Appl. Log., 2023)

Asymmetric Cut and Choose Games. - Christopher Henney-Turner; Peter Holy; Philipp Schlicht; Philip D. Welch (Bull. Symb. Log., 2023)