|
|
|
|
References
|
|
| |
| 1. |
Yu. L. Ershov, “Opredelimost v nasledstvenno konechnykh nadstroikakh”, Dokl. RAN, 340:1 (1995), 12–14    |
| 2. |
Yu. L. Ershov, “$\Sigma$-definability of algebraic structures”, Handbook of recursive mathematics,
vol. 1, Recursive model theory, Stud. Logic Found. Math., 138, eds. Y. L. Ershov, S. S. Goncharov, A. Nerode, J. B. Remmel, Elsevier Science B.V., Amsterdam, 1998, 235–260 |
| 3. |
Yu. L. Ershov, Opredelimost i vychislimost, Sib. shkola algebry i logiki, Nauchnaya kniga (NII MIOO NGU), Novosibirsk, 1996 |
| 4. |
J. Barwise, Admissible sets and structures, Springer-Verlag, Berlin, 1975 |
| 5. |
R. Soar, Vychislimo perechislimye mnozhestva i stepeni, Kazanskoe matem. ob-vo, Kazan, 2000 |
| 6. |
Dzh. Saks, Teoriya nasyschennykh modelei, Mir, M., 1976 |
| 7. |
Yu. L. Ershov, Problemy razreshimosti i konstruktivnye modeli, Nauka, M., 1980 |
| 8. |
H. A. Kierstead, J. B. Remmel, “Indiscernibles and decidable models”, J. Symb.
Log., 48:1 (1983), 21–32  |
| 9. |
H. A. Kierstead, J. B. Remmel, “Degrees of indiscernibles in decidable models”, Trans. Am. Math. Soc., 289:1 (1985), 41–57 |
| 10. |
A. Macintyre, D. Marker, “Degrees of recursively saturated models”, Trans. Am.
Math. Soc., 282:2 (1984), 539–554 |
| 11. |
A. I. Stukachev, “$\Sigma$-dopustimye semeistva nad lineinymi poryadkami”, Algebra i logika, 41:2 (2002), 228–252 |
| 12. |
A. I. Stukachev, “Ob opredelimosti v dopustimykh mnozhestvakh vida $HF(\mathfrak{M})$”, Problemy teoreticheskoi i prikladnoi matematiki, tr. 33-i region. molodezh. konf., Ekaterinburg, 2002, 47–50 |
| 13. |
J. P. Ressayre, “Models with compactness properties relative to an admissible
language”, Ann. Math. Logic, 11:1 (1977), 31–56 |
