Trivial Automorphisms of Reduced Products
From MaRDI portal
Abstract: We introduce a general method for showing under weak forcing axioms that reduced products of countable models of a theory have as few automorphisms as possible. We show that such forcing axioms imply that reduced products of countably infinite or finite fields, linear orders, trees, or random graphs have only trivial automorphisms.
This page was built for publication: Trivial Automorphisms of Reduced Products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6443639)