Solovyev Valery Dmitrievich

Publications in Math-Net.Ru

1. Readability formulas for three levels of Russian school textbooks
   
   Zap. Nauchn. Sem. POMI, 529 (2023),  140–156
2. Variations in average word valence of Russian books over a century and social change
   
   Zap. Nauchn. Sem. POMI, 529 (2023),  24–42
3. Comparative analysis of the similarity measures based on the moving approximation transformation in problems of time series classification
   
   Proceedings of ISP RAS, 28:6 (2016),  207–222
4. Transformation of metrics used in clusterization methods for building the phylogenetic language trees
   
   Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:3 (2009),  229–239
5. Проект “Электронная библиотека книг XVIII века” – первый этап
   
   Issled. Inform., 9 (2005),  117–124
6. Один подход к классификации текстов на основе нейронных сетей
   
   Issled. Inform., 7 (2004),  21–28
7. Электронная коллекция древних книг и рукописей
   
   Issled. Inform., 4 (2002),  21–26
8. Применима ли нечеткая логика к описанию структуры языка?
   
   Issled. Inform., 2 (2000),  55–62
9. К построению метаязыка описания семантики
   
   Issled. Inform., 1 (1999),  75–84
10. The completeness problem in the class of polynomials is decidable
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 8,  56–59
11. Initial segments of effectively finite orders
    
    Mat. Zametki, 61:6 (1997),  950–953
12. The structure of information distribution in an infinite sequence
    
    Diskr. Mat., 8:2 (1996),  97–107
13. Program algebras of recursive functions
    
    Uspekhi Mat. Nauk, 51:4(310) (1996),  125–144
14. On a family of precomplete classes of recursive functions and predicates
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 8,  57–62
15. Computability by nondeterministic program and the Moschovakis search computability
    
    Mat. Zametki, 56:1 (1994),  149–152
16. Program-closed classes of general recursive functions and predicates of finite rank
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 9,  45–60
17. The structure of program-closed classes of multiplace functions and predicates
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 7,  47–50
18. The completeness problem in algebras of recursive functions with supplementary means of closure
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 6,  46–52
19. Closed classes in $k$-valued logic with an operation of branching by predicates
    
    Diskr. Mat., 2:4 (1990),  18–25
20. Completeness of systems of recursive functions and predicates. II
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1989, no. 9,  60–66
21. Completeness of systems of recursive functions and predicates. I
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1989, no. 8,  56–63
22. The structure of closed classes of computable functions and predicates
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 12,  51–56
23. A criterion for the completeness of recursively enumerable sets, and some generalizations of a fixed point theorem
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1977, no. 4,  3–7
24. Some generalizations of the notions of reducibility and creativity
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1976, no. 3,  65–72
25. Superhypersimple sets
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1976, no. 2,  108–110


26. Cognitive science and artificial intelligence: interpenetration and relative autonomy of these interdisciplinary areas in the nomenclature of the Higher attestation commission
    
    Artificial Intelligence and Decision Making, 2021, no. 4,  99–102