Examples of nonautostable systems (Q1077409): Difference between revisions

An enumeration \(\nu\) : \(N\to {\mathfrak A}\) is called a constructivization of a countable model \({\mathfrak A}\) if (roughly speaking) the relations and functions of the presentation of \({\mathfrak A}\) on N given by \(\nu\) are recursive. Constructivizations \(\nu\) and \(\mu\) are autoequivalent if there is an automorphism \(\phi\) of \({\mathfrak A}\) and a recursive function f such that \(\phi \nu =\mu f\). Model \({\mathfrak A}\) is called autostable if any two constructivizations of \({\mathfrak A}\) are autoequivalent. The algorithmic dimension of a model \({\mathfrak A}\), \(\dim_ A{\mathfrak A}\), is the maximal number of nonautoequivalent constructivizations of \({\mathfrak A}\). Among the results on algorithmic dimensions and possible numbers of autoequivalent constructivizations, which are not recursively equivalent, we have the following: there are models \({\mathfrak A}\) and \({\mathfrak B}\) such that \(\dim_ A{\mathfrak A}=1\) and \(\dim_ A{\mathfrak A}^ 2\geq 2\), \(\dim_ A{\mathfrak B}=\aleph_ 0\) and \(\dim_ A{\mathfrak B}^ 2=1\). Examples are given to show that the class of autostable models is not closed under finitely generated extensions. The paper is concluded with remarks concerning autostability of periodic groups.