Philipp Schlicht

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 28

Top Topics

Top Venues

Ann. Pure Appl. Log.

Bull. Symb. Log.

Publications

Christopher Henney-Turner, Peter Holy, Philipp Schlicht, Philip D. Welch
Asymmetric Cut and Choose Games. Bull. Symb. Log. 29 (4) (2023)
Christopher Henney-Turner, Philipp Schlicht
Forcing axioms via ground model interpretations. Ann. Pure Appl. Log. 174 (6) (2023)
André Nies, Philipp Schlicht, Katrin Tent
Coarse groups, and the isomorphism problem for oligomorphic groups. J. Math. Log. 22 (1) (2022)
Peter Holy, Marlene Koelbing, Philipp Schlicht, Wolfgang Wohofsky
Ideal topologies in higher descriptive set theory. Ann. Pure Appl. Log. 173 (4) (2022)
Fabiana Castiblanco, Philipp Schlicht
Preserving levels of projective determinacy by tree forcings. Ann. Pure Appl. Log. 172 (4) (2021)
Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr
Ordered Semiautomatic Rings with Applications to Geometry. CoRR (2021)
Juan P. Aguilera, Sandra Müller, Philipp Schlicht
-projective sets. Ann. Pure Appl. Log. 172 (4) (2021)
Victoria Gitman, Joel David Hamkins, Peter Holy, Philipp Schlicht, Kameryn J. Williams
The exact strength of the class forcing Theorem. J. Symb. Log. 85 (3) (2020)
Merlin Carl, Philipp Schlicht, Philip D. Welch
Decision times of infinite computations. CoRR (2020)
Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr
Ordered Semiautomatic Rings with Applications to Geometry. LATA (2020)
Merlin Carl, Benjamin G. Rin, Philipp Schlicht
Reachability for infinite time Turing machines with long tapes. Log. Methods Comput. Sci. 16 (2) (2020)
Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan
The isomorphism problem for tree-automatic ordinals with addition. Inf. Process. Lett. 149 (2019)
Peter Holy, Regula Krapf, Philipp Schlicht
Characterizations of pretameness and the Ord-cc. Ann. Pure Appl. Log. 169 (8) (2018)
Merlin Carl, Philipp Schlicht
Randomness via Infinite Computation and Effective Descriptive Set Theory. J. Symb. Log. 83 (2) (2018)
Philipp Lücke, Philipp Schlicht
Measurable cardinals and good -wellorderings. Math. Log. Q. 64 (3) (2018)
Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan
The isomorphism problem for tree-automatic ordinals with addition. CoRR (2018)
Philipp Schlicht
Continuous reducibility and dimension of metric spaces. Arch. Math. Log. 57 (3-4) (2018)
Merlin Carl, Philipp Schlicht, Philip D. Welch
Recognizable sets and Woodin cardinals: computation beyond the constructible universe. Ann. Pure Appl. Log. 169 (4) (2018)
Merlin Carl, Benjamin G. Rin, Philipp Schlicht
Writability and reachability for alpha-tape infinite time Turing machines. CoRR (2018)
Merlin Carl, Philipp Schlicht
Infinite Computations with Random Oracles. Notre Dame J. Formal Log. 58 (2) (2017)
Philipp Lücke, Ralf Schindler, Philipp Schlicht
Σ1(κ)-DEFINABLE SUBSETS OF H(κ +). J. Symb. Log. 82 (3) (2017)
Rupert Hölzl, Sanjay Jain, Philipp Schlicht, Karen Seidel, Frank Stephan
Automatic Learning from Repetitive Texts. ALT (2017)
Merlin Carl, Philipp Schlicht
The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. CiE (2017)
Philipp Lücke, Philipp Schlicht, Thilo Weinert
Choiceless Ramsey Theory of Linear Orders. Order 34 (3) (2017)
Philipp Schlicht
Perfect Subsets of generalized Baire Spaces and Long Games. J. Symb. Log. 82 (4) (2017)
Martin Huschenbett, Alexander Kartzow, Philipp Schlicht
Pumping for ordinal-automatic structures. Comput. 6 (2) (2017)
Peter Holy, Regula Krapf, Philipp Lücke, Ana Njegomir, Philipp Schlicht
Class forcing, the forcing Theorem and Boolean Completions. J. Symb. Log. 81 (4) (2016)
Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan
Tree-automatic scattered linear orders. Theor. Comput. Sci. 626 (2016)
Luca Motto Ros, Philipp Schlicht, Victor L. Selivanov
Wadge-like reducibilities on arbitrary quasi-Polish spaces. Math. Struct. Comput. Sci. 25 (8) (2015)
Philipp Schlicht
Thin equivalence relations and inner models. Ann. Pure Appl. Log. 165 (10) (2014)
Philipp Schlicht, Frank Stephan
Automata on ordinals and automaticity of linear orders. Ann. Pure Appl. Log. 164 (5) (2013)
Alexander Kartzow, Philipp Schlicht
Structures without Scattered-Automatic Presentation. CiE (2013)
Alexander Kartzow, Philipp Schlicht
Structures Without Scattered-Automatic Presentation CoRR (2013)
Peter Koepke, Karen Räsch, Philipp Schlicht
A minimal Prikry-type forcing for singularizing a measurable cardinal. J. Symb. Log. 78 (1) (2013)
Dan Brumleve, Joel David Hamkins, Philipp Schlicht
The Mate-in-n Problem of Infinite Chess Is Decidable. CiE (2012)
Dan Brumleve, Joel David Hamkins, Philipp Schlicht
The mate-in-n problem of infinite chess is decidable CoRR (2012)
Philipp Schlicht, Benjamin Seyfferth
Tree Representations via Ordinal Machines. Comput. 1 (1) (2012)
Philipp Schlicht, Frank Stephan
Automata on Ordinals and Linear Orders. CiE (2011)
Ralf Schindler, Philipp Schlicht
Thin equivalence relations in scaled pointclasses. Math. Log. Q. 57 (6) (2011)