11 citations · 49 across the 21 of their papers we have counts for
33 papers
Uniform Bounds in D-Minimal Structures
Madie Farris, Philipp Hieronymi
Let be an expansion of the real field such that every subset of definable in either has interior or is a finite union of discrete sets. Ans…
Axiomatizations of Presburger Arithmetic With Predicates For Powers
Philipp Hieronymi, Michael Reitmeir, Xiaoduo Wang
We give a complete first-order axiomatization of the structure , where is a set of pairwise multipl…
Decidability bounds for Presburger arithmetic extended by sine
Eion Blanchard, Philipp Hieronymi
We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic (-PA), and systematically study decision problems for sets of…
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…