×

zbMATH — the first resource for mathematics

Autostability of models. (English. Russian original) Zbl 0468.03023
Algebra Logic 19, 28-37 (1980); translation from Algebra Logika 19, 45-58 (1980).

MSC:
03D45 Theory of numerations, effectively presented structures
03C15 Model theory of denumerable and separable structures
03C45 Classification theory, stability, and related concepts in model theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] S. S. Goncharov, ”Constructive Boolean algebras,” in: Third All-Union Conf. Math. Logic [in Russian], Novosibirsk (1974). · Zbl 0281.02049
[2] S. S. Goncharov, ”On the number of nonautoequivalent constructivizations,” Algebra Logika,16, No. 3, 257–282 (1977).
[3] S. S. Goncharov, ”Nonautoequivalent constructivizations of atomic Boolean algebras,” Mat. Zametki,19, No. 6, 853–858 (1976).
[4] S. S. Goncharov, ”Some properties of constructivizations of Boolean algebras,” Sib. Mat. Zh.16, No. 2, 264–278 (1975).
[5] V. D. Dzgoev, ”Constructivization of distributive structures with relative complements,” in: Fourteenth All-Union Algebraic Conference [in Russian], Part 2, Novosibirsk (1977).
[6] V. D. Dzgoev, ”Constructivization of certain structures,” Dep. No. 1606-1979, VINITI.
[7] V. D. Dzgoev, ”Recursive automorphisms of constructive models,” in: Fifteenth All-Union Algebraic Conference [in Russian], Krasnoyarsk (1979).
[8] Yu. L. Ershov, Theory of Numerations [in Russian], Part III, Novosibirsk State Univ. (1974).
[9] A. T. Nurtazin, ”Computable classes and algebraic conditions for autostability,” Author’s Abstract of Doctoral Dissertation, Novosibirsk (1974).
[10] H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967). · Zbl 0183.01401
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.