On positive enumarated models. (English. Russian original) Zbl 0737.03020
Sib. Math. J. 32, No. 3, 507-513 (1991); translation from Sib. Mat. Zh. 32, No. 3(187), 184-191 (1991).
The paper contains proofs of the results stated in the author’s paper [Dokl. Akad. Nauk UzSSR 1990, No. 3, 8-9 (1990; Zbl 0708.03022)].
Reviewer: A.Ryaskin (Novosibirsk)
MSC:
| 03D45 | Theory of numerations, effectively presented structures |
| 03C57 | Computable structure theory, computable model theory |
References:
| [1] | S. S. Goncharov, ?Information models and languages for their description,? Vychislitel’nye Sistemy, No. 107, 52-70 (1985). · Zbl 0621.68020 |
| [2] | N. Kh. Kasymov, ?On algebras with finitely approximable positively representable enrichments,? Algebra Logika,26, No. 6, 715-730 (1987). · Zbl 0661.03038 |
| [3] | N. Kh. Kasymov and B. M. Khusainov, ?Finitely generated representable and absolutely locally finite algebras,? Vyschislitel’nye Sistemy, No. 116, 3-15 (1986). · Zbl 0646.03042 |
| [4] | Yu. L. Ershov, Problems of Solvability and Constructive Models [in Russian], Nauka, Moscow (1980). |
| [5] | H. Rodgers, Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1976). |
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.
