On constructive models of theories with linear Rudin-Keisler ordering

autostability of prime models under strong constructivizations

“…A line of inquiry into the spectrum of computable models in the class of countable models is presented in [8,9,[25][26][27][28]. This problem is closely allied to descriptions of Turing degrees in which models of an Ehrenfeucht theory have representations that are computable (decidable) with respect to these degrees.…”