11 citations · 49 across the 21 of their papers we have counts for
4 papers · 1 filter
A strong version of Cobham's theorem
Philipp Hieronymi, Chris Schulz
Let be two multiplicatively independent integers. Cobham's famous theorem states that a set is both -recognizable and -recognizable…
Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata
Reed Oei, Dun Ma, Christian Schulz +1
Pecan is an automated theorem prover for reasoning about properties of Sturmian words, an important object in the field of combinatorics on words. It is capable of efficiently prov…
Decidability for Sturmian words
Philipp Hieronymi, Dun Ma, Reed Oei +3
We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwa…
Pathological examples of structures with o-minimal open core
Alexi Block Gorman, Erin Caulfield, Philipp Hieronymi
This paper answers several open questions around structures with o-minimal open core. We construct an expansion of an o-minimal structure by a unary predicate such th…