Lyubetskii Vasilii Aleksandrovich

Publications in Math-Net.Ru

1. Independence of the comprehension schema in second-order arithmetic from the parameter-free countable choice
   
   Mat. Zametki, 117:2 (2025),  257–269
2. Chair of Mathematical Logic and Theory of Algorithms
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2025, no. 1,  23–32
3. An exact quadratic algorithm for the shortest tree transformation
   
   Dokl. RAN. Math. Inf. Proc. Upr., 519 (2024),  22–27
4. Models of set theory in which the separation theorem fails
   
   Izv. RAN. Ser. Mat., 85:6 (2021),  164–204
5. An almost exact linear algorithm for transformation of chain-cycle graphs with optimization of the sum of operation costs
   
   Dokl. RAN. Math. Inf. Proc. Upr., 494 (2020),  26–29
6. On the Equality Relation Modulo a Countable Set
   
   Mat. Zametki, 108:4 (2020),  629–631
7. Definable Elements of Definable Borel Sets
   
   Mat. Zametki, 105:5 (2019),  696–707
8. Absoluteness of the solovay set Σ
   
   Sibirsk. Mat. Zh., 60:6 (2019),  1286–1290
9. A linear algorithm for restructuring a graph
   
   Avtomat. i Telemekh., 2018, no. 12,  124–141
10. Non-uniformizable sets of second projective level with countable cross-sections in the form of Vitali classes
    
    Izv. RAN. Ser. Mat., 82:1 (2018),  65–96
11. Algorithm of transformation of a graph into another one with minimal cost
    
    Inform. Primen., 11:1 (2017),  79–89
12. A Countable Definable Set Containing no Definable Elements
    
    Mat. Zametki, 102:3 (2017),  369–382
13. Linear algorithm for minimal rearrangement of structures
    
    Probl. Peredachi Inf., 53:1 (2017),  60–78
14. A generic property of the Solovay set $\Sigma$
    
    Sibirsk. Mat. Zh., 58:6 (2017),  1302–1305
15. On Effective $\sigma$-Boundedness and $\sigma$-Compactness in Solovay's Model
    
    Mat. Zametki, 98:2 (2015),  247–257
16. Generalization of one construction by Solovay
    
    Sibirsk. Mat. Zh., 56:6 (2015),  1341–1350
17. Elaboration of the Homologous Plastid-Encoded Protein Families that Separate Paralogs in Magnoliophytes
    
    Mat. Biolog. Bioinform., 8:1 (2013),  225–233
18. Effective Compactness and Sigma-Compactness
    
    Mat. Zametki, 91:6 (2012),  840–852
19. Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube
    
    Probl. Peredachi Inf., 48:2 (2012),  113–120
20. The tree nearest on average to a given set of trees
    
    Probl. Peredachi Inf., 47:3 (2011),  64–79
21. An effective minimal encoding of uncountable sets
    
    Sibirsk. Mat. Zh., 52:5 (2011),  1074–1086
22. On symmetric matrices with indeterminate leading diagonals
    
    Probl. Peredachi Inf., 45:3 (2009),  73–78
23. Gibbs Field Approach for Evolutionary Analysis of Regulatory Signal of Gene Expression
    
    Probl. Peredachi Inf., 44:4 (2008),  52–71
24. Borel reducibility as an additive property of domains
    
    Zap. Nauchn. Sem. POMI, 358 (2008),  189–198
25. Nonstandard Representations of Locally Compact Groups
    
    Mat. Zametki, 82:3 (2007),  383–389
26. Reducibility of Monadic Equivalence Relations
    
    Mat. Zametki, 81:6 (2007),  842–854
27. Problems in set-theoretic nonstandard analysis
    
    Uspekhi Mat. Nauk, 62:1(373) (2007),  51–122
28. A Cofinal Family of Equivalence Relations and Borel Ideals Generating Them
    
    Trudy Mat. Inst. Steklova, 252 (2006),  94–113
29. Perfect subsets of invariant CA-sets
    
    Mat. Zametki, 77:3 (2005),  334–338
30. On the Set of Constructible Reals
    
    Trudy Mat. Inst. Steklova, 247 (2004),  95–128
31. Stochastic Dynamical Games with Information of Various Types
    
    Probl. Peredachi Inf., 39:3 (2003),  40–71
32. On some classical problems of descriptive set theory
    
    Uspekhi Mat. Nauk, 58:5(353) (2003),  3–88
33. Computer Logic in Information Processes
    
    Probl. Peredachi Inf., 35:2 (1999),  107–111
34. Transfer theorems and the algebra of modal operators
    
    Algebra Logika, 36:3 (1997),  282–303
35. On Some Applications of the Semantic Evaluation Method
    
    Probl. Peredachi Inf., 32:3 (1996),  82–96
36. On One Approach to Modelling Intelligent Systems
    
    Probl. Peredachi Inf., 29:3 (1993),  107–109
37. The transition from deducibility in classical set theory to deducibility in intuitionistic set theory for the language of rings
    
    Algebra Logika, 30:6 (1991),  652–670
38. Intuitionistic theory of algebraic systems and Heyting-valued analysis
    
    Algebra Logika, 30:3 (1991),  320–332
39. Model completeness of a theory and valuation of formulas
    
    Algebra Logika, 29:1 (1990),  15–28
40. Valuations and sheaves. On some questions of non-standard analysis
    
    Uspekhi Mat. Nauk, 44:4(268) (1989),  99–153
41. Some algebraic questions of nonstandard analysis
    
    Dokl. Akad. Nauk SSSR, 280:1 (1985),  38–41
42. Embedding of sheaves in a Heyting-valued universe.
    
    Dokl. Akad. Nauk SSSR, 268:4 (1983),  794–798
43. Some applications of nonstandard analysis in the theory of Boolean-valued measures
    
    Dokl. Akad. Nauk SSSR, 256:5 (1981),  1037–1041
44. Definable sequences of countable ordinals
    
    Dokl. Akad. Nauk SSSR, 196:6 (1971),  1263–1265
45. From the existence of a nonmeasurable set of type $A_2$ there follows the existence of an uncountable set that contains no perfect subset of type $CA$
    
    Dokl. Akad. Nauk SSSR, 195:3 (1970),  548–550
46. Construction of an effectively inaccessible cardinal in a natural prolongation of the Zermelo–Fraenkel system
    
    Dokl. Akad. Nauk SSSR, 187:6 (1969),  1225–1228
47. Some consequences of the hypothesis on the uncountability of the set of constructible real numbers
    
    Dokl. Akad. Nauk SSSR, 182:4 (1968),  758–759