Related papers: Automorphism Groups of Countable Arithmetically Sa…
We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.
In this paper, we extend the concept of a Lascar generic automorphism in the setting of models of Peano arithmetic ($\mathrm{PA}$) to the subgroup of the automorphism group of a countable recursively saturated model $\mathcal{M}$ of…
If M is a nonstandard model of Peano Arithmetic, then M is lofty iff M has a simple elementary extension that is recursively saturated. This had previously been known for countable M.
We show that for every countable recursively saturated model $M$ of Peano Arithmetic and every subset $A \subseteq M$, there exists a full satisfaction class $S_A \subset M^2$ such that $A$ is definable in $(M,S_A)$ without parametres. It…
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…
Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This…
For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…
The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b…
It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
We prove that for a stable theory $T,$ if $M$ is a saturated model of $T$ of cardinality $\lambda$ where $\lambda > \big|T\big|,$ then $Aut(M)$ has a dense free subgroup on $2^{\lambda}$ generators. This affirms a conjecture of Hodges.
In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…
We prove that for a number of ultrahomogeneous structures $M$, including those with the free amalgamation property, the powers of the automorphism group ${\rm{Aut}}(M)^n$, $n=1,2,\ldots$, and the group $L_0({\rm{ Aut}}(M))$ of measurable…
Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…
Automated theorem provers (ATPs) can disprove conjectures by saturating a set of clauses, but the resulting saturated sets are opaque certificates. In the unit equational fragment, a saturated set can in fact be read as a convergent rewrite…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…