Voir la notice de l'article provenant de la source Math-Net.Ru
[1] G. S. Tseytin, “On the problem of recognition of properties of associative calculuses”, Dokl. Akad. Nauk SSSR, 107:2 (1956), 209–212 (Russian) | MR | Zbl
[2] G. S. Tseytin, “Associative calculus with insoluble equivalence problem”, Dokl. Akad. Nauk SSSR, 107:3 (1956), 370–371 (Russian) | MR | Zbl
[3] G. S. Tseitin, “On the complexity of derivation in propositional calculus”, Semin. Math., 8, V. A. Steklov Math. Inst., Leningrad, 1970, 115–125 ; Automation of reasoning, v. 2, Classical papers on computational logic, 1967–1970, Springer-Verlag, Berlin–New York, 1983, 466–483 | MR | Zbl | MR | Zbl
[4] G. S. Tseytin, Studies in constructive analysis (constructive real numbers and pointwise defined functions), D.Sc. thesis, Leningrad State University, Leningrad, 1968 (Russian)
[5] G. S. Tseitin, “Reduced form of normal algorithms and a linear acceleration theorem”, J. Soviet Math., 1:1 (1973), 148–153 | DOI | MR | Zbl
[6] G. S. Tseitin, “Lower estimate of the number of steps for an inverting normal algorithm and other similar algorithms”, J. Soviet Math., 1:1 (1973), 154–168 | DOI | MR | Zbl
[7] G. S. Tseytin (ed.), Algol 68: methods for implementation, Publishing house of Leningrad University, Leningrad, 1976, 224 pp. (Russian)
[8] “From logicism to proceduralism (an autobiographical account)”, Algorithms in modern mathematics and computer science (Urgench 1979), Lecture Notes in Comput. Sci., 122, Springer, Berlin–New York, 1981, 390–396 | DOI | MR | Zbl
[9] G. S. Tseytin, “Is mathematics part of computer science?”, Computer tools in education, 1999, no. СЏ5, 3–7 (Russian)
[10] G. Tseytin, M. Hofmann, M. O'Mahony, and D. Lyons, “Tracing individual public transport customers from an anonymous transaction database”, J. Public Transp., 9:4 (2006), 47–60 | DOI