Wednesday, April 3, 2024 3:30 pm
-
5:00 pm
EDT (GMT -04:00)
Laindon Burnett, Department of Pure Mathematics, University of Waterloo
"Sturmian Sequence Decidability Does Not Generalize"
In 2022, it was shown that much like Presburger arithmetic itself, Presburger arithmetic along with a Sturmian sequence is a decidable theory. We give an overview of Konieczny's 2024 proof that this does not extend to generalized polynomials, themselves a generalization of Sturmian sequences.
MC 5479