zbMATH — the first resource for mathematics

The quantity of nonautoequivalent constructivizations. (English) Zbl 0407.03040

03C99 Model theory
03D99 Computability and recursion theory
03F65 Other constructive mathematics
PDF BibTeX Cite
Full Text: DOI
[1] S. S. Goncharov, ”Autostability and computable families of constructivizations,” Algebra Logika,14, No. 6, 647–680 (1975).
[2] A. I. Mal’tsev, ”Constructive algebras,” Usp. Mat. Nauk,16, No. 3, 3–60 (1961).
[3] S. S. Goncharov, ”Some properties of constructivizations of Boolean algebras,” Sib. Mat. Zh.,16, No. 2, 264–278 (1975).
[4] V. L. Selivanov, ”On enumerations of families of general recursive functions,” Algebra Logika,15, No. 2, 205–226 (1976).
[5] Yu. L. Ershov, Theory of Enumerations [in Russian], Vol. 1, Novosibirsk (1969). · Zbl 0273.02024
[6] A. I. Mal’tsev, ”Positive and negative enumerations,” Dokl. Akad. Nauk SSSR,160, No. 2, 278–280 (1965).
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.