Trakhtenbrot Boris Avraamovich

Publications in Math-Net.Ru

1. Frequency computations
   
   Trudy Mat. Inst. Steklov., 133 (1973),  221–232
2. Autoreducibility
   
   Dokl. Akad. Nauk SSSR, 192:6 (1970),  1224–1227
3. The complexity of reduction algorithms in Novikov-Boone constructions.
   
   Algebra Logika, 8:1 (1969),  93–128
4. Normed signalizers for Turing computations
   
   Algebra i Logika. Sem., 5:6 (1966),  61–70
5. Letter to the editor
   
   Algebra i Logika. Sem., 5:5 (1966),  95
6. Optimal computations and the frequency phenomenon of Jablonskiĭ
   
   Algebra i Logika. Sem., 4:5 (1965),  79–93
7. Turing computers with logarithmic delay
   
   Algebra i Logika. Sem., 3:4 (1964),  33–48
8. An estimate of the weight of a finite tree
   
   Sibirsk. Mat. Zh., 5:1 (1964),  186–191
9. On the frequency computability of functions
   
   Algebra i Logika. Sem., 2:1 (1963),  25–32
10. Finite automata and the logic of one-place predicates
    
    Sibirsk. Mat. Zh., 3:1 (1962),  103–131
11. Finite automata and the logic of single-place predicates
    
    Dokl. Akad. Nauk SSSR, 140:2 (1961),  326–329
12. Certain constructions in the logic of one-place predicates
    
    Dokl. Akad. Nauk SSSR, 138:2 (1961),  320–321
13. The synthesis of logical nets whose operators are described in terms of one-place predicate calculus
    
    Dokl. Akad. Nauk SSSR, 118:4 (1958),  646–649
14. The theory of non-repeating contact schemes
    
    Trudy Mat. Inst. Steklov., 51 (1958),  226–269
15. On operators realizable in logical nets
    
    Dokl. Akad. Nauk SSSR, 112:6 (1957),  1005–1007
16. Definition of finite set and deductive incompleteness of the theory of sets
    
    Izv. Akad. Nauk SSSR Ser. Mat., 20:4 (1956),  569–582


17. Mikhail Abramovich Taitslin (1936–2013)
    
    Sib. Èlektron. Mat. Izv., 10 (2013),  54–65