RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Tseitin Grigorii Samuilovich

Statistics Math-Net.Ru
Total publications: 17
Scientific articles: 16

Number of views:
This page:1009
Abstract pages:3572
Full texts:1448

http://www.mathnet.ru/eng/person29896
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/212472

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

17. Correction
G. S. Tseitin
Uspekhi Mat. Nauk, 11:2(68) (1956),  251–2511
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018