Arithmetical Complexity and Absoluteness of Rigidity Phenomena for Ulam Sequences
Authors
Frank Gilson
Abstract
We analyse the logical complexity and absoluteness of natural statements about Ulam sequences, with particular emphasis on the rigidity phenomena introduced by Hinman, Kuca, Schlesinger and Sheydvasser for the family $U(1,n)$. For each pair of coprime integers $a
