Recursive categoricity and recursive stability
type: Item
instance of: scholarly article
title: Recursive categoricity and recursive stability
zbMATH Open document ID: 0605.03023
DOI: 10.1016/0168-0072(86)90070-9
author: John N. Crossley
author: Alfred B. Manaster
author: Michael Moses
published in: Annals of Pure and Applied Logic
publication date: 1986-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 03F15
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03C65
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 06A05
zbMATH DE Number: 3977010
zbMATH Keywords: recursive categoricity
zbMATH Keywords: linear orders
zbMATH Keywords: recursive stability
MaRDI profile type: Publication
full work available at URL: 0168-0072(86)90070-9
OpenAlex ID: W2058578159
cites work: Describing ordinals using functionals of transfinite type
cites work: Q3919698
cites work: Normalfunktionen und Hauptfolgen
cites work: Some recognizable properties of solvable groups
cites work: Q4068683
cites work: Q5608007
cites work: Q5575559
cites work: Q4040322
cites work: The given
cites work: Constructive order types, II
cites work: Q3910512
cites work: Q5815686
cites work: Q5815688
cites work: Q3289861
cites work: Q5557888
cites work: Q4055632
cites work: The first order properties of products of algebraic systems
cites work: Autostability and computable families of constructivizations
cites work: Some proposals for reviving the philosophy of mathematics
cites work: Natural well-orderings
cites work: Q4099559
cites work: On the categoricity in power of elementary deductive systems and some related problems
cites work: Q5596230
cites work: Q5586197
cites work: Effective content of field theory
cites work: Foundations of recursive model theory
cites work: Categoricity in Power
cites work: Decidable models
cites work: Recursive linear orders with recursive successivities
cites work: Q4058646
cites work: On complete theories with a finite number of denumerable models
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Recursively Categorical Linear Orderings
cites work: $ℵ_0$-categoricity of linear orderings
cites work: Q5726688
cites work: Generalized quantifiers and well orderings
cites work: Q3936728
cites work: A metamathematical theorem on the theory of ordinal numbers
description: scientific article; zbMATH DE number 3977010