Freidson R I

Publications in Math-Net.Ru

1. Finite approximation approach to investigation of the complexity of recursive predicates
   
   Zap. Nauchn. Sem. LOMI, 49 (1975),  131–158
2. Table approximations to recursive predicates
   
   Zap. Nauchn. Sem. LOMI, 40 (1974),  131–135
3. Families of the recursive predicates of the zero measure
   
   Zap. Nauchn. Sem. LOMI, 32 (1972),  121–128
4. Regular approximations to the recursive predicates
   
   Zap. Nauchn. Sem. LOMI, 20 (1971),  220–233
5. A certain characterization of the complexity of recursive predicates
   
   Trudy Mat. Inst. Steklov., 113 (1970),  79–101
6. A complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm
   
   Zap. Nauchn. Sem. LOMI, 8 (1968),  225–233
7. Representation of recursive predicates by Rabin's machines
   
   Zap. Nauchn. Sem. LOMI, 4 (1967),  209–218