default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilipp Hieronymi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Eion Blanchard
, Philipp Hieronymi:
Decidability bounds for Presburger arithmetic extended by sine. Ann. Pure Appl. Log. 175(10): 103487 (2024)- [j15]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian words. Log. Methods Comput. Sci. 20(3) (2024) - [i7]Philipp Hieronymi, Sven Manthe, Christian Schulz:
A Cobham theorem for scalar multiplication. CoRR abs/2407.15118 (2024) - 2023
- [j14]Philipp Hieronymi:
Fractals and the monadic second order theory of one successor. J. Log. Anal. 15 (2023) - 2022
- [c2]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian Words. CSL 2022: 24:1-24:23 - [c1]Philipp Hieronymi, Christian Schulz:
A strong version of Cobham's theorem. STOC 2022: 1172-1179 - [i6]Eion Blanchard, Philipp Hieronymi:
Decidability bounds for Presburger arithmetic extended by sine. CoRR abs/2204.00099 (2022) - 2021
- [j13]Philipp Hieronymi, Danny Nguyen, Igor Pak:
Presburger Arithmetic with algebraic scalar multiplications. Log. Methods Comput. Sci. 17(3) (2021) - [j12]Alexi Block Gorman, Erin Caulfield, Philipp Hieronymi:
Pathological examples of structures with o-minimal open core. Math. Log. Q. 67(3): 382-393 (2021) - [i5]Reed Oei, Dun Ma, Christian Schulz, Philipp Hieronymi:
Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata. CoRR abs/2102.01727 (2021) - [i4]Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian words. CoRR abs/2102.08207 (2021) - [i3]Philipp Hieronymi, Christian Schulz:
A strong version of Cobham's theorem. CoRR abs/2110.11858 (2021) - 2020
- [j11]Alexi Block Gorman, Philipp Hieronymi, Elliot Kaplan, Ruoyu Meng, Erik Walsberg, Zihe Wang, Ziqin Xiong, Hongru Yang:
Continuous Regular Functions. Log. Methods Comput. Sci. 16(1) (2020) - [j10]Pantelis E. Eleftheriou, Ayhan Günaydin, Philipp Hieronymi:
The choice property in tame expansions of o-minimal structures. Math. Log. Q. 66(2): 239-246 (2020)
2010 – 2019
- 2019
- [j9]Philipp Hieronymi:
When is scalar multiplication decidable? Ann. Pure Appl. Log. 170(10): 1162-1175 (2019) - [i2]Alexi Block Gorman, Philipp Hieronymi, Elliot Kaplan, Ruoyu Meng, Erik Walsberg, Zihe Wang, Ziqin Xiong, Hongru Yang:
Continuous Regular Functions. CoRR abs/1901.03366 (2019) - 2018
- [j8]Philipp Hieronymi, Travis Nell, Erik Walsberg:
Wild theories with o-minimal open core. Ann. Pure Appl. Log. 169(2): 146-163 (2018) - [j7]Philipp Hieronymi, Alonza Terry Jr.:
Ostrowski Numeration Systems, Addition, and Finite Automata. Notre Dame J. Formal Log. 59(2): 215-232 (2018) - [i1]Philipp Hieronymi, Danny Nguyen, Igor Pak:
Presburger Arithmetic with algebraic scalar multiplications. CoRR abs/1805.03624 (2018) - 2017
- [j6]Philipp Hieronymi, Travis Nell:
Distal and non-distal Pairs. J. Symb. Log. 82(1): 375-383 (2017) - 2016
- [j5]Philipp Hieronymi:
Expansions of the Ordered additive Group of Real numbers by two discrete Subgroups. J. Symb. Log. 81(3): 1007-1027 (2016) - 2015
- [j4]Antongiulio Fornasiero, Philipp Hieronymi:
A Fundamental Dichotomy for definably Complete expansions of Ordered Fields. J. Symb. Log. 80(4): 1091-1115 (2015) - 2013
- [j3]Philipp Hieronymi:
An analogue of the Baire category theorem. J. Symb. Log. 78(1): 207-213 (2013) - 2011
- [j2]Philipp Hieronymi:
The real field with an irrational power function and a dense multiplicative subgroup. J. Lond. Math. Soc. 83(1): 153-167 (2011) - [j1]Ayhan Günaydin, Philipp Hieronymi:
Dependent pairs. J. Symb. Log. 76(2): 377-390 (2011)
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-08-29 21:00 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:
