Autostability and computable families of constructivizations. (English) Zbl 0382.03033


03D45 Theory of numerations, effectively presented structures
03C45 Classification theory, stability, and related concepts in model theory
Full Text: DOI


[1] Yu. L. Ershov, Enumeration Theory [in Russian], Vol. 3, Novosibirsk (1974).
[2] A. I. Mal’tsev, ”Constructive algebras,” Usp. Matem. Nauk,16, No. 3, 3–60 (1961).
[3] A. T. Nurtazin, ”Strong and weak constructivizations,” Algebra i Logika,13, No. 3, 311–323 (1974).
[4] R. Cusin, ”The number of countable generic models for finite forcing,” Fund. Math.,84, No. 3, 265–270 (1974). · Zbl 0287.02035
[5] R. L. Vaught, ”Denumerable models of complete theories, Infinitistic methods,” Proc. Symp. Foundations of Math., Warsaw, (1961), pp. 303–321. · Zbl 0113.24302
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.