Search Results for author: Philipp Hieronymi

Found 2 papers, 0 papers with code

Decidability for Sturmian words

no code implementations16 Feb 2021 Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey Shallit

We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable.

Logic in Computer Science Combinatorics Logic

Pathological examples of structures with o-minimal open core

no code implementations7 Jan 2021 Alexi Block Gorman, Erin Caulfield, Philipp Hieronymi

This paper answers several open questions around structures with o-minimal open core.

Logic 03C64

Cannot find the paper you are looking for? You can Submit a new open access paper.