default search action
Philipp Schlicht
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j27]Christopher Henney-Turner
, Philipp Schlicht:
Forcing axioms via ground model interpretations. Ann. Pure Appl. Log. 174(6): 103260 (2023) - [j26]Christopher Henney-Turner
Asymmetric Cut and Choose Games. Bull. Symb. Log. 29(4): 588-625 (2023) - 2022
- [j25]Peter Holy, Marlene Koelbing, Philipp Schlicht
Ideal topologies in higher descriptive set theory. Ann. Pure Appl. Log. 173(4): 103061 (2022) - [j24]André Nies, Philipp Schlicht
Coarse groups, and the isomorphism problem for oligomorphic groups. J. Math. Log. 22(1): 2150029:1-2150029:31 (2022) - 2021
- [j23]Fabiana Castiblanco, Philipp Schlicht
Preserving levels of projective determinacy by tree forcings. Ann. Pure Appl. Log. 172(4): 102918 (2021) - [j22]Juan P. Aguilera
Long games and σ-projective sets. Ann. Pure Appl. Log. 172(4): 102939 (2021) - [i6]Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr:
Ordered Semiautomatic Rings with Applications to Geometry. CoRR abs/2103.06714 (2021) - 2020
- [j21]Victoria Gitman, Joel David Hamkins, Peter Holy, Philipp Schlicht
The exact strength of the class forcing Theorem. J. Symb. Log. 85(3): 869-905 (2020) - [j20]Merlin Carl, Benjamin G. Rin, Philipp Schlicht
Reachability for infinite time Turing machines with long tapes. Log. Methods Comput. Sci. 16(2) (2020) - [c6]Ziyuan Gao, Sanjay Jain
Ordered Semiautomatic Rings with Applications to Geometry. LATA 2020: 141-153 - [i5]Merlin Carl, Philipp Schlicht, Philip D. Welch:
Decision times of infinite computations. CoRR abs/2011.04942 (2020)
2010 – 2019
- 2019
- [j19]Sanjay Jain
The isomorphism problem for tree-automatic ordinals with addition. Inf. Process. Lett. 149: 19-24 (2019) - 2018
- [j18]Philipp Schlicht
Continuous reducibility and dimension of metric spaces. Arch. Math. Log. 57(3-4): 329-359 (2018) - [j17]Merlin Carl, Philipp Schlicht
Recognizable sets and Woodin cardinals: computation beyond the constructible universe. Ann. Pure Appl. Log. 169(4): 312-332 (2018) - [j16]Peter Holy, Regula Krapf, Philipp Schlicht
Characterizations of pretameness and the Ord-cc. Ann. Pure Appl. Log. 169(8): 775-802 (2018) - [j15]Merlin Carl, Philipp Schlicht
Randomness via Infinite Computation and Effective Descriptive Set Theory. J. Symb. Log. 83(2): 766-789 (2018) - [j14]Philipp Lücke
Measurable cardinals and good -wellorderings. Math. Log. Q. 64(3): 207-217 (2018) - [i4]Merlin Carl, Benjamin G. Rin, Philipp Schlicht:
Writability and reachability for alpha-tape infinite time Turing machines. CoRR abs/1802.05734 (2018) - [i3]Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan:
The isomorphism problem for tree-automatic ordinals with addition. CoRR abs/1810.13153 (2018) - 2017
- [j13]Martin Huschenbett, Alexander Kartzow, Philipp Schlicht
Pumping for ordinal-automatic structures. Comput. 6(2): 125-164 (2017) - [j12]Philipp Lücke
Σ1(κ)-DEFINABLE SUBSETS OF H(κ +). J. Symb. Log. 82(3): 1106-1131 (2017) - [j11]Philipp Schlicht
Perfect Subsets of generalized Baire Spaces and Long Games. J. Symb. Log. 82(4): 1317-1355 (2017) - [j10]Merlin Carl, Philipp Schlicht
Infinite Computations with Random Oracles. Notre Dame J. Formal Log. 58(2): 249-270 (2017) - [j9]Philipp Lücke
Choiceless Ramsey Theory of Linear Orders. Order 34(3): 369-418 (2017) - [c5]Rupert Hölzl, Sanjay Jain, Philipp Schlicht, Karen Seidel, Frank Stephan:
Automatic Learning from Repetitive Texts. ALT 2017: 129-150 - [c4]Merlin Carl, Philipp Schlicht
The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. CiE 2017: 198-209 - 2016
- [j8]Peter Holy, Regula Krapf, Philipp Lücke
Class forcing, the forcing Theorem and Boolean Completions. J. Symb. Log. 81(4): 1500-1530 (2016) - [j7]Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht
Tree-automatic scattered linear orders. Theor. Comput. Sci. 626: 83-96 (2016) - 2015
- [j6]Luca Motto Ros
Wadge-like reducibilities on arbitrary quasi-Polish spaces. Math. Struct. Comput. Sci. 25(8): 1705-1754 (2015) - 2014
- [j5]Philipp Schlicht
Thin equivalence relations and inner models. Ann. Pure Appl. Log. 165(10): 1577-1625 (2014) - [p1]Luca Motto Ros, Philipp Schlicht:
Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces. Logic, Computation, Hierarchies 2014: 213-258 - 2013
- [j4]Philipp Schlicht
Automata on ordinals and automaticity of linear orders. Ann. Pure Appl. Log. 164(5): 523-527 (2013) - [j3]Peter Koepke, Karen Räsch, Philipp Schlicht
A minimal Prikry-type forcing for singularizing a measurable cardinal. J. Symb. Log. 78(1): 85-100 (2013) - [c3]Alexander Kartzow, Philipp Schlicht
Structures without Scattered-Automatic Presentation. CiE 2013: 273-283 - [i2]Alexander Kartzow, Philipp Schlicht:
Structures Without Scattered-Automatic Presentation. CoRR abs/1304.0912 (2013) - 2012
- [j2]Philipp Schlicht
Tree Representations via Ordinal Machines. Comput. 1(1): 45-57 (2012) - [c2]Dan Brumleve, Joel David Hamkins
The Mate-in-n Problem of Infinite Chess Is Decidable. CiE 2012: 78-88 - [i1]Dan Brumleve, Joel David Hamkins, Philipp Schlicht:
The mate-in-n problem of infinite chess is decidable. CoRR abs/1201.5597 (2012) - 2011
- [j1]Ralf Schindler, Philipp Schlicht
Thin equivalence relations in scaled pointclasses. Math. Log. Q. 57(6): 615-620 (2011) - [c1]Philipp Schlicht
Automata on Ordinals and Linear Orders. CiE 2011: 252-259
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: