MODNET

Research Training Network in Model Theory

Publications > Preprint server > Preprint Number 2154
Preprint Number 2154
2154. Eion Blanchard, Philipp Hieronymi Decidability bounds for Presburger arithmetic extended by sine E-mail: Submission date: 31 March 2022 Abstract: We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic (sin-PA), and systematically study decision problems for sets of sentences in sin-PA. In particular, we detail a decision algorithm for existential sin-PA sentences under assumption of Schanuel's conjecture. This procedure reduces decisions to the theory of the ordered additive group of real numbers extended by sine, which is decidable under Schanuel's conjecture. On the other hand, we prove that four alternating quantifier blocks suffice for undecidability of sin-PA sentences. To do so, we explicitly interpret the weak monadic second-order theory of the grid, which is undecidable, in sin-PA. Mathematics Subject Classification: 03B25 (Primary) 03C62 (Secondary) Keywords and phrases: |

Last updated: April 21 2022 16:38 | Please send your corrections to: |