Recursive categoricity and recursive stability

Computable structure theory, computable model theory (03C57) Models of other mathematical theories (03C65) Theory of numerations, effectively presented structures (03D45) Recursive ordinals and ordinal notations (03F15) Total orders (06A05)

Review text

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.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Recursive categoricity and recursive stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084103)