Strong and weak constructivization and computable families. (English) Zbl 0305.02061
References:
| [1] | Yu. L. Ershov, ”Constructive models,” in: Selected Questions of Algebra and Logic [in Russian], Novosibirsk (1973), pp. 111-130. |
| [2] | A. I. Mal’tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965). |
| [3] | A. I. Mal’tsev, ”Constructive algebras,” Uspekhi Matem. Nauk,16, No. 3, 3-60 (1961). |
| [4] | A. I. Mal’tsev, ”On recursive Abelian groups,” Dokl. Akad. Nauk,146, No. 5, 1009-1012 (1962). |
| [5] | A. T. Nurtazin, ”Category theory without principal model-complete extensions,” Algebra i Logika,12, No. 3, 360 (1973). |
| [6] | L. A. Harrington, ”Structures with rec. presentation,” Notes Am. Math., Soc.,18, No. 5, 826 (1971). |
| [7] | R. L. Vaught, ”Denumerable models of complete theories, infinistic methods,” in: Proceedings of the Symposium on the Foundations of Mathematics, 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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
