Recursive categoricity and recursive stability
This paper comprises two parts. 1. A model \({\mathcal A}\) in a class \({\mathcal C}\) is strongly recursively stable in C if 1) A is recursively presented and 2) if B is elementarily equivalent to A and B is in C, then not only is B isomorphic to A but every isomorphism from B onto A is recursive. Various results from the literature are uniformly presented by characterizing the structures which are strongly recursively stable amongst the well-orderings. 2. A number of results on the recursive stability or strong recursive stability of linear relations with the block relation are presented. Two elements in a linear ordering are said to be in the same block if there are only a finite number of points between them in the linear ordering.
scientific article; zbMATH DE number 3977010
scientific article