Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-24T12:10:11.647Z Has data issue: false hasContentIssue false

In Memoriam: Albert G. Dragalin 1941–1998

Published online by Cambridge University Press:  15 January 2014

Rights & Permissions [Opens in a new window]

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Obituary
Copyright
Copyright © Association for Symbolic Logic 1999

References

REFERENCES

[1] Dragalin, A. G., The computability of primitive recursive terms of finite type, and primitive recursive realization, Seminars in mathematics, vol. 8, Plenum Publishers, 1970, Russian original 1968.Google Scholar
[2] Dragalin, A. G., Constructive models of intuitionistic choice sequences (Russian), Studies in formalized languages and nonclassical logics, Izdat. “Nauka”, Moscow, 1974, pp. 214252.Google Scholar
[3] Dragalin, A. G., New kinds of realizability and the Markov rule, Soviet Mathematics, Doklady, vol. 251 (1980), no. 3, pp. 534537.Google Scholar
[4] Dragalin, A. G., Mathematical intuitionism, introduction to proof theory, Translation of Mathematical Monographs, no. 67, American Mathematical Society, Providence, RI, 1988,Russian original 1979.CrossRefGoogle Scholar
[5] Dragalin, A. G., Some trends in automated reasoning, Journal of Information Processing Cybernet., vol. 25 (1989), no. 11–12, pp. 607618.Google Scholar
[6] Dragalin, A. G., Cut-elimination in the theory of definable sets of natural numbers, Publicationes Mathematicae, Debrecen, vol. 51 (1997), no. 1/2, pp. 153164, Russian version 1977.Google Scholar
[7] Kolmogorov, A. N. and Dragalin, A. G., Introduction into mathematical logic (Russian), Moscow University, Moscow, 1982.Google Scholar
[8] Kolmogorov, A. N. and Dragalin, A. G., Mathematical logic, advanced chapters (Russian), Moscow University, Moscow, 1984.Google Scholar