Philipp Schlicht

According to our database1, Philipp Schlicht authored at least 25 papers between 2011 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
The isomorphism problem for tree-automatic ordinals with addition.
Inf. Process. Lett., 2019

2018
Measurable cardinals and good -wellorderings.
Math. Log. Q., 2018

Randomness via Infinite Computation and Effective Descriptive Set Theory.
J. Symb. Log., 2018

Characterizations of pretameness and the Ord-cc.
Ann. Pure Appl. Logic, 2018

Recognizable sets and Woodin cardinals: computation beyond the constructible universe.
Ann. Pure Appl. Logic, 2018

Continuous reducibility and dimension of metric spaces.
Arch. Math. Log., 2018

2017
Choiceless Ramsey Theory of Linear Orders.
Order, 2017

Infinite Computations with Random Oracles.
Notre Dame Journal of Formal Logic, 2017

Perfect Subsets of generalized Baire Spaces and Long Games.
J. Symb. Log., 2017

Σ1(κ)-DEFINABLE SUBSETS OF H(κ +).
J. Symb. Log., 2017

Pumping for ordinal-automatic structures.
Computability, 2017

The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters.
Proceedings of the Unveiling Dynamics and Complexity, 2017

Automatic Learning from Repetitive Texts.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016
Tree-automatic scattered linear orders.
Theor. Comput. Sci., 2016

Class forcing, the forcing Theorem and Boolean Completions.
J. Symb. Log., 2016

2015
Wadge-like reducibilities on arbitrary quasi-Polish spaces.
Mathematical Structures in Computer Science, 2015

2014
Thin equivalence relations and inner models.
Ann. Pure Appl. Logic, 2014

Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces.
Proceedings of the Logic, Computation, Hierarchies, 2014

2013
A minimal Prikry-type forcing for singularizing a measurable cardinal.
J. Symb. Log., 2013

Automata on ordinals and automaticity of linear orders.
Ann. Pure Appl. Logic, 2013

Structures without Scattered-Automatic Presentation.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Tree Representations via Ordinal Machines.
Computability, 2012

The Mate-in-n Problem of Infinite Chess Is Decidable.
Proceedings of the How the World Computes, 2012

2011
Thin equivalence relations in scaled pointclasses.
Math. Log. Q., 2011

Automata on Ordinals and Linear Orders.
Proceedings of the Models of Computation in Context, 2011


  Loading...