3 citations · 5 across the 8 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2023
Semënov Arithmetic, Affine VASS, and String Constraints
Andrei Draghici, Christoph Haase, Florin Manea
We study extensions of Semënov arithmetic, the first-order theory of the structure . It is well-knonw that this theory becomes undecidable when extended with…
cs.LO2018
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability
Joel Day, Vijay Ganesh, Paul He +2
The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding w…