Philipp Schlicht

40 papers B 1C 5Journal 33

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