×

zbMATH — the first resource for mathematics

Strong constructivizability of homogeneous models. (English. Russian original) Zbl 0441.03015
Algebra Logic 17, 247-263 (1979); translation from Algebra Logika 17, 363-388 (1978).

MSC:
03D45 Theory of numerations, effectively presented structures
03B25 Decidability of theories and sets of sentences
03C50 Models with special properties (saturated, rigid, etc.)
03C99 Model theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] S. S. Goncharov and A. T. Nurtazin, ”Constructive models of complete decidable theories,” Algebra Logika,12, No. 2, 125–142 (1973). · Zbl 0288.02022
[2] Yu. L. Ershov, Theory of Enumerations [in Russian], Vol. 3, Novosibirsk (1974).
[3] H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967). · Zbl 0183.01401
[4] C. C. Chang and H. J. Keisler, Model Theory, North-Holland, Amsterdam (1973).
[5] T. Millar, ”The theory of recursively presented models,” Dissertation, Cornell University (1976). · Zbl 0354.35014
[6] M. Morley, ”Decidable models,” Israel J. Math.,25, 233–240 (1976). · Zbl 0361.02067
[7] L. Harrington, ”Recursively presentable prime models,” J. Symb. Logic,39, 305–309 (1974). · Zbl 0332.02055
[8] M. G. Peretyat’kin, ”A criterion for strong constructivizability of a homogeneous model,” Algebra Logika,17, No. 4, 436–454 (1978).
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.