Hostname: page-component-848d4c4894-x24gv Total loading time: 0 Render date: 2024-05-18T05:29:37.928Z Has data issue: false hasContentIssue false
  • English
  • Français

IN MEMORIAM: MIKHAIL A. TAITSLIN 1936–2013

Published online by Cambridge University Press:  13 May 2014

Oleg Belegradek  and
Boris Zilber
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
In Memoriam
Information
Bulletin of Symbolic Logic , Volume 20 , Issue 1 , March 2014 , pp. 99 - 102
Copyright
Copyright © The Association for Symbolic Logic 2014 

References

REFERENCES

Ershov, Yu. L., Lavrov, I.A., Taimanov, A.D., and Taitslin, M.A., Elementary theories(Russian). Uspekhi Matematicheskikh Nauk, vol. 20 (1965), no. 4(124), pp. 37–108; translation in Russian Mathematical Surveys, vol. 20(1965), no. 4, pp. 35–105.Google Scholar
Taitslin, M.A., The isomorphism problem for commutative semigroups (Russian). Matematicheskii Sbornik, vol. 93 (1974), no. 135, pp. 103–128; translation in Math. USSR Sb., vol. 22 (1974), no. 1, pp. 104–129.Google Scholar
Taitslin, M.A., Model theory (Russian), Publications of the Department of Algebra and Mathematical Logic of the Novosibirsk State University, no. 6, Novosibirsk, 1970.Google Scholar
Abakumov, A.I., Palyutin, E.A., Taitslin, M.A., and Shishmarev, Yu. E., Categorial quasivarieties (Russian). Algebra i Logika, vol. 11 (1972), no. 1, pp. 3–38; translation in Algebra and Logic, vol. 11(1972), no. 1, pp. 1–20.Google Scholar
Belyaev, V. Ya. and Taitslin, M.A., Elementary properties of existentially closed systems (Russian). Uspekhi Matematicheskikh Nauk, vol. 34 (1979), no. 2(206), pp. 39–94; translation in Russian Mathematical Surveys, vol. 34 (1979), no. 2, pp. 43–97.Google Scholar
Stolboushkin, A.P. and Taitslin, M.A., Deterministic dynamic logic is strictly weaker than dynamic logic. Information and Control, vol. 57 (1983), no. 1, pp. 48–55.CrossRefGoogle Scholar
Stolboushkin, A.P. and Taitslin, M.A., The comparison of the expressive power of first-order dynamic logics. Theoretical Computer Science, vol. 27 (1983), no. 1–2, pp. 197–209.Google Scholar
Musikaev, I.Kh. and Taitslin, M.A., Limitations of the program memory and the expressive power of dynamic logics. Information and Computation, vol. 103 (1993), no. 2, pp. 195–203.Google Scholar
Archangelsky, D.A., Dekhtyar, M.I., and Taitslin, M.A., Linear logic for nets with bounded resources. Annals of Pure and Applied Logic, vol. 78 (1996), no. 1–3, pp. 3–28.Google Scholar
Archangelsky, D.A. and Taitslin, M.A., Linear logic with fixed resources. Annals of Pure and Applied Logic, vol. 67 (1994), no. 1–3, pp. 3–28.Google Scholar
Stolboushkin, A.P. and Taitslin, M.A., Finite queries do not have effective syntax. Information and Computation, vol. 153 (1999), no. 1, pp. 99–16.Google Scholar
Belegradek, O.V., Stolboushkin, A.P., and Taitslin, M.A., Extended order-generic queries. Annals of Pure and Applied Logic, vol. 97 (1999), no. 1–3, pp. 85–25.Google Scholar
Dudakov, S.M. and Taitslin, M.A., Collapse results for query languages in database theory (Russian). Uspekhi Matematicheskikh Nauk, vol. 61 (2006), no. 2(368), pp. 3–66; translation in Russian Mathematical Surveys, vol. 61(2006), no. 2, pp. 195–253.Google Scholar
Ershov, Yu. L., Palyutin, E.A., and Taitslin, M.A., Mathematical logic (Russian), Publications of the Department of Algebra and Mathematical Logic of the Novosibirsk State University, no. 12, Novosibirsk, 1973.Google Scholar
Stolboushkin, A.P. and Taitslin, M.A., Mathematical foundations of computer science (Russian), vol. 1–3, Tver State University, Tver, 1998, p. 367.Google Scholar