Undecidability conjecture for three-block Presburger arithmetic with non-quadratic scalar multiplication
Statement
Let be a non-quadratic scalar. Undecidability conjecture. -Presburger arithmetic sentences with three alternating blocks of quantifiers are undecidable. The paper contrasts this with the known complexity results for one and three alternating blocks in the quadratic case; the conjecture concerns the unresolved complexity and decidability landscape for non-quadratic scalar multiplication.
Record
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.