Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Tseitin, Grigorii Samuilovich
(1936–2022)
Statistics Math-Net.Ru
Total publications: 17
Scientific articles: 16

Number of views:
This page:2230
Abstract pages:5872
Full texts:3022
Doctor of physico-mathematical sciences (1967)
Birth date: 15.11.1936

https://www.mathnet.ru/eng/person29896
https://ru.wikipedia.org/wiki/Tseitin,_Grigorii_Samuilovich
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/212472
https://elibrary.ru/author_items.asp?authorid=74263

Publications in Math-Net.Ru Citations
1974
1. Z. R. Dang, G. S. Tseitin, “An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections”, Zap. Nauchn. Sem. LOMI, 40 (1974),  14–23  mathnet  mathscinet  zmath
1971
2. G. S. Tseitin, “A pseudo-rundamental sequence not equivalent to any monotone sequence”, Zap. Nauchn. Sem. LOMI, 20 (1971),  263–271  mathnet  mathscinet  zmath
3. G. S. Tseitin, “The lower estimate of number of steps for reversing normal algorithms and other similar algorithms”, Zap. Nauchn. Sem. LOMI, 20 (1971),  243–262  mathnet  mathscinet  zmath 2
4. G. S. Tseitin, “A reduced form of normal algorithms and a linear speed-up theorem”, Zap. Nauchn. Sem. LOMI, 20 (1971),  234–242  mathnet  mathscinet  zmath 2
5. I. D. Zaslavsky, G. S. Tseitin, “Yet another constructive version of Cauchy theorem”, Zap. Nauchn. Sem. LOMI, 20 (1971),  36–39  mathnet  mathscinet  zmath
1970
6. G. S. Tseitin, “The upper bounds of enumerable sets of constructive real numbers”, Trudy Mat. Inst. Steklov., 113 (1970),  102–172  mathnet  mathscinet  zmath; Proc. Steklov Inst. Math., 113 (1970), 119–194 1
1968
7. G. S. Tseitin, “On the disjunctive rank of formulas of constructive arithmetic”, Zap. Nauchn. Sem. LOMI, 8 (1968),  260–271  mathnet  mathscinet  zmath 2
8. G. S. Tseitin, “On the complexity of proof in prepositional calculus”, Zap. Nauchn. Sem. LOMI, 8 (1968),  234–259  mathnet  mathscinet  zmath 26
9. B. A. Kushner, G. S. Tseitin, “Some properties of $F$-numbers”, Zap. Nauchn. Sem. LOMI, 8 (1968),  107–120  mathnet  mathscinet  zmath
1964
10. G. S. Tseitin, “Three theorems on constructive functions”, Trudy Mat. Inst. Steklov., 72 (1964),  537–543  mathnet  mathscinet  zmath
11. I. D. Zaslavsky, G. S. Tseitin, “Concerning a generalized principle of constructive selection”, Trudy Mat. Inst. Steklov., 72 (1964),  344–347  mathnet  mathscinet  zmath 2
12. G. S. Tseitin, “A method of presenting the theory of algorithms and enumerable sets”, Trudy Mat. Inst. Steklov., 72 (1964),  69–98  mathnet  mathscinet  zmath 3
1962
13. I. D. Zaslavsky, G. S. Tseitin, “Singular coverings and properties of constructive functions connected with them”, Trudy Mat. Inst. Steklov., 67 (1962),  458–502  mathnet  mathscinet  zmath 2
14. G. S. Tseitin, “Mean-value theorems in constructive analysis”, Trudy Mat. Inst. Steklov., 67 (1962),  362–384  mathnet  mathscinet  zmath
15. G. S. Tseitin, “Algorithmic operators in constructive metric spaces”, Trudy Mat. Inst. Steklov., 67 (1962),  295–361  mathnet  mathscinet  zmath 1
1958
16. G. S. Tseitin, “An associative calculus with an insoluble problem of equivalence”, Trudy Mat. Inst. Steklov., 52 (1958),  172–189  mathnet  mathscinet  zmath 5
1956
17. G. S. Tseitin, “Correction”, Uspekhi Mat. Nauk, 11:2(68) (1956),  251–2511  mathnet

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024