Fixed Sets of Automorphisms of Countable, Arithmetically Saturated Structures
Logic
2022-11-18 v2
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.
Keywords
Cite
@article{arxiv.2204.03557,
title = {Fixed Sets of Automorphisms of Countable, Arithmetically Saturated Structures},
author = {James H. Schmerl},
journal= {arXiv preprint arXiv:2204.03557},
year = {2022}
}
Comments
There was an error that I was unable to correct