Fixed Sets of Automorphisms of Countable, Arithmetically Saturated Structures
arXiv:2204.03557
Abstract
If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically saturated.
arXiv commentThere was an error that I was unable to correct