Existential Büchi arithmetic in two coprime bases
Statement
For all integers with , determine whether the existential fragment of is decidable; that is, whether there is an algorithm deciding every sentence of the form , where is quantifier-free in the language with order, addition, and the Büchi predicates and . The cited preprint claims that this fragment is decidable.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.