Fields of research interest: theory of algorithms, model theory, algebra, and applications in theoretical computer science. Basing on the result on the existence of non-autostable models with finite algorithmic dimension, the theory of algorithmic dimension is developed. New methods to prove infinite algorithmic dimension are found. These methods made possible a solution to the problem of characterization of spectra of algorithmic dimension for series of concrete classes of models. A criterion of decidability for homogeneous models is established. Basing on it, solutions to problems of M. Morley and of Peretyatkin–Denisov were obtained. A solution to the Malcev problem on the characterization of classes of axioms with strong epimorphisms and strong homomorphisms is given. A series of results on constructive Boolean algebras is obtained. Nilpotent groups of finite algorithmic dimension were studied. A characterization is obtained for autostability of nilpotent torsion-free groups of finite rank as well as for Abelian $p$-groups. A new method to construct computable numbering is suggested that made possible solutions to a series of problems on Friedberg numberings, on families with unique positive numbering, etc. A solution to the problem of autostability of finitary constant expansions was obtained together with American scientists R. Shore, B. Khoussainov, and P. Cholak. A solution to the problem of two-element spectrum with recursive $T$-degree was obtained together with B.Khoussainov. A problem on a family with trivial Rogers semilattice but nontrivial inclusion was solved together with S. A. Badaev. A problem on the existence of strong constructive homogeneous extensions is solved. Together with an Italian logician A. Sorbi, the Rogers semilattice of computable numberings of arithmetical sets was investigated. Together with J. Knight (USA), the structure theory of computable classes of models is suggested, a problem of characterization of $\Sigma_1^1$-relations on computable models is solved. More than 160 papers were published; among them are two manuals: "Lectures in model theory" and "Introduction to the logic and methodology of science" (with Yu. L. Ershov and K. F. Samokhvalov), monographs: "Countable Boolean algebras" (1988) and "Countable Boolean algebras and decidability" (1996, English translation 1997), "Constructive models" (1999, with Yu. L. Ershov, English translation 2000) and "Handbook of recursive mathematics" (1999, S. S. Goncharov, Yu. L. Ershov, A. Nerode, J. Remmel, V. Marek editors).
Biography
1973 — graduated with honors from the Department of Mechanics and Mathematics of Novosibirsk State University (NSU). 1974 — defended thesis for candidatskaya degree 1981 — defended thesis for doctorskaya degree. A list of my works conteins more then 160 titles. I am superwisor of seminars at Novosibirsk Uninversity and Sobolev Institute of Mathematics.
1976 — won Lenin Komsomol Prize on science and technology for a series of works on constructive Boolean Algebras. 1977 — became an assistant professor at NSU. 1982 — was awarded with a Silver badge of "Algebra and Logic" Seminar for research activity. 1983 — won Siberian Branch of Russian Academy of Sciences Prize for establishing the theory of semantic programming in cooperation with academician Yu. L. Ershov and doctor of physical and mathematical sciences D. I. Sviridenko. 1985 — became a professor at NSU. 1991 — became an elector at Russian Academy of Sciences. 1993 — was elected to be a corresponding member of the Academy of Sciences of Higher School. 1995 — was elected to be a full member of the International Academy of Sciences of Higher School. 1996 — the dean of the Department of Mechanics and Mathematics NSU. 1997 — was elected to be a corresponding member of the Russian Academy of Sciences. 1997 — Mal'sev prize of Russian Academy of Sciences. I am supervisor of an RFFI grant, co-supervisor of INTAS, INTAS-RFFI grants; investigator of RFFI-DFG grant, of Russian-American grant, and of the Marsden grant of Royal Society of New Zealand.
Main publications:
Goncharov S. S. Countable Boolean algebras and decidability. Siberian School of Algebra and Logic, New-York, NY: Plenum. xii, 1997, 318 p.
Goncharov S. S., Ershov Yu. L. Constructive models. Kluwer Academic / Plenum Press Consultants Burean, xii, New-York, 2000, 293 p.
Goncharov S. S., Khoussainov B. On the spectrum of degrees of decidable relations // Dokl. Math., 1997, 55(1), 55–57.
Goncharov S. S., Khoussainov B., Cholak P., Shore R. Computably categorical structures and expansions by constants // J. Symb. Log., 1999, 64(1), 13–37.
Goncharov S. S. (ed.), Ershov Yu. L. (ed.), Nerode A. (ed.), Remmel J. B. (ed.), Marek V. (ed.). Handbook of Recursive Mathematics. Studies in Logic and the Foundations of Mathematics. 138, 139. Amsterdam: Elsevier. xlvi, 1998, 1372 p.
A. V. Nechesov, E. E. Vityaev, S. S. Goncharov, D. I. Sviridenko, “The task-based approach: a new paradigm for building trustworthy artificial intelligence”, Izvestiya Irkutskogo gosudarstvennogo universiteta. Seriya Matematika, 54 (2025), 96–112
S. S. Goncharov, “Computable Boolean algebras and complexity of the Fréchet ideal”, J. Math. Sci. (New York), 284:1 (2024), 72–82
3.
S. S. Goncharov, J. Xiang, “Isomorphism of atomless Boolean algebras with distinguished ideal”, Algebra and Logic, 63:3 (2024), 179–185
4.
S. A. Badaev, S. S. Goncharov, Algebra and Logic, 61:3 (2022), 225–229
5.
S. S. Goncharov, M. I. Marchuk, “The degree of decidable categoricity of a model with infinite solutions for complete formulas”, Algebra and Logic, 60:3 (2021), 200–206
6.
S. Goncharov, S. Ospichev, D. Ponomaryov, D. Sviridenko, “The expressiveness of looping terms in the semantic programming”, Sib. elektron. matem. izv., 17 (2020), 380–394
S. S. Goncharov, R. Miller, V. Harizanov, “Turing degrees of complete formulas of almost prime models”, Algebra and Logic, 58:3 (2019), 282–287
8.
S. S. Goncharov, D. I. Sviridenko, “Recursive terms in semantic programming”, Siberian Math. J., 59:6 (2018), 1014–1023
9.
Goncharov S.S., Knight J.F., Souldatos I., “Hanf number for Scott sentences of computable structures”, Archive for Mathematical Logic, 57:7–8 (2018), 889–907
10.
S. S. Goncharov, N. A. Bazhenov, M. I. Marchuk, “The index set of the groups autostable relative to strong constructivizations”, Siberian Math. J., 58:1 (2017), 72–77
11.
S. S. Goncharov, “Conditional terms in semantic programming”, Siberian Math. J., 58:5 (2017), 794–800
12.
S. S. Goncharov, M. I. Marchuk, “Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations”, Dokl. Math., 91:2 (2015), 158–159
13.
S. S. Goncharov, M. I. Marchuk, “Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations”, Algebra and Logic, 54:2 (2015), 108–126
14.
S. S. Goncharov, N. A. Bazhenov, M. I. Marchuk, “The index set of Boolean algebras autostable relative to strong constructivizations”, Siberian Math. J., 56:3 (2015), 393–404
15.
S. S. Goncharov, N. A. Bazhenov, M. I. Marchuk, “Indeksnye mnozhestva avtoustoichivykh otnositelno silnykh konstruktivizatsii konstruktivnykh modelei estestvennykh klassov”, Dokl. AN, 464:1 (2015), 12–14
16.
S. S. Goncharov, M. I. Marchuk, “Indeksnye mnozhestva avtoustoichivykh otnositelno silnykh konstruktivizatsii konstruktivnykh modelei konechnoi signatury i signatury grafov”, Algebra i logika, 2015 (to appear)
17.
S. S. Goncharov, N. A. Bazhenov, M. I. Marchuk, “Indeksnoe mnozhestvo avtoustoichivykh otnositelno silnykh konstruktivizatsii lineinykh poryadkov”, Vestn. NGU. Ser. matem., mekh., inform., 15:3 (2015) (to appear)
18.
S. S. Goncharov, N. A. Bazhenov, M. I. Marchuk, “The index set of linear orderings that are autostable relative to strong constructivizations”, J. Math. Sci., 221:6 (2017), 840–848
19.
E. B. Fokina, S. S. Goncharov, V. Harizanov, O. V. Kudinov, D. Turetsky, “Index sets for $n$-decidable structures categorical relative to $m$-decidable presentations”, Algebra and Logic, 54:4 (2015), 336–341
20.
S. S. Goncharov, M. I. Marchuk, “Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations”, Algebra and Logic, 54:6 (2015), 428–439
21.
S. A. Badaev, S. S. Goncharov, “Generalized computable universal numberings”, Algebra and Logic, 53:5 (2014), 355–364
22.
S. S. Goncharov, “Index Sets of Almost Prime Constructive Models”, J. Math. Sci., 205:3 (2015), 355–367
23.
S. S. Goncharov, M. I. Marchuk, “Index Sets of Autostable Relative to Strong Constructivizations Constructive Models”, J. Math. Sci., 205:3 (2015), 368–388
24.
Goncharov S. S., “Problems of autostability and spectrum of autostability”, The Bulletin of Symbolic Logic, 18:3 (2012), 422-423
Calvert, W.; Goncharov, S. S.; Knight, J. F.; et al., “Categoricity of computable infinitary theories”, Archive For Mathematical Logic, 48:1 (2009), 13 pp. http://link.springer.com/article/10.1007
Goncharov S.S., “ON TWO PROBLEMS OF TURING COMPLEXITY FOR STRONGLY MINIMAL THEORIES”, Doklady Mathematics, 77:3 (2008), 438-440
39.
Goncharov S.S., Kogabaev N.T., “O $\Sigma$01-KLASSIFIKATsII OTNOShENII NA VYChISLIMYKh STRUKTURAKh”, Vestnik Novosibirskogo gosudarstvennogo universiteta. Seriya: Matematika, mekhanika, informatika, 8 (2008), 9 pp.
40.
Serikzhan Badaev, Sergey Goncharov, “Computability and Numberings”, New Computational Paradigms Changing Conceptions of What is Computable, http://link.springer.com/book/10.1007/978-0-387-68546-5, ISBN: 978-0-387-36033-1 (Print) 978-0-387-68546-5 (Online), Springer, 2008, 19-34http://link.springer.com/chapter/10.1007/978-0-387-68546-5_2
S. S. Goncharov, N. T. Kogabaev, “On $\Sigma^0_1$-Classification of Relations on Computable Structures”, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., mech. and informatics, 8:4 (2008), 23–32
44.
S. S. Goncharov, “Algorithmic Compexity of Countable Models of Strongly Minimal Theories”, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., mech. and informatics, 8:2 (2008), 38–53
45.
S. S. Goncharov, B. N. Drobotun, “About the Role of the Mathematical Logic in Education”, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., mech. and informatics, 8:1 (2008), 15–25
46.
Calvert W., Fokina E., Goncharov S.S., Kudinov O., Morozov A.S., Puzarenko V., Knight J.F., “INDEX SETS FOR CLASSES OF HIGH RANK STRUCTURES”, Journal of Symbolic Logic, 72:4 (2007), 1418-1432
Goncharov S. S., “Computability and Computable Models”, Mathematical Problems from Applied Logic II International Mathematical Series. Vol. 5, Editors: Dov M. Gabbay, Michael Zakharyaschev, Sergei S. Goncharov, Springer, 2007, 99-216http://link.springer.com/chapter/10.1007/978-0-387-69245-6_3
48.
S. A. Badaev, S. S. Goncharov, A. Sorbi, “Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy”, Algebra and Logic, 45:6 (2006), 361–370
49.
S. S. Goncharov, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., mech. and informatics, 6:3 (2006), 3–4
50.
S. S. Goncharov, “Aleksandr Vasil'evich Kazhikhov. 1946–2005”, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., mech. and informatics, 6:2 (2006), 3–5
51.
S. A. Badaev, S. S. Goncharov, A. Sorbi, “Elementary Theories for Rogers Semilattices”, Algebra and Logic, 44:3 (2005), 143–147
52.
S. S. Goncharov, V. S. Harizanova, J. F. Knight, A. S. Morozov, A. V. Romina, “On automorphic tuples of elements in computable models”, Siberian Math. J., 46:3 (2005), 405–412
53.
Goncharov S., Harizanov V., Knight J., McCoy C., Miller R., Solomon R., “ENUMERATIONS IN COMPUTABLE STRUCTURE THEORY”, Annals of Pure and Applied Logic, 136:3 (2005), 7 pp.
S. S. Goncharov, B. Khoussainov, “Complexity of Categorical Theories with Computable Models”, Algebra and Logic, 43:6 (2004), 365–373
55.
S. S. Goncharov, Ch. F. McCoy, J. F. Knight, V. S. Harizanova, “Relatively Hyperimmune Relations on Structures”, Algebra and Logic, 43:2 (2004), 94–101
56.
Goncharov S.S., Harizanov V.S., Knight J.F., Shore R.A., “$\Pi^1_1$ RELATIONS AND PATHS THROUGH $O$”, Journal of Symbolic Logic, 69:2 (2004), 585-611
S. S. Goncharov, R. Downey, D. Hirschfeldt, “Degree Spectra of Relations on Boolean Algebras”, Algebra and Logic, 42:2 (2003), 105–111
58.
M. M. Lavrent'ev, Yu. L. Ershov, S. S. Kutateladze, A. A. Borovkov, S. K. Godunov, S. S. Goncharov, Yu. G. Reshetnyak, V. G. Romanov, V. D. Mazurov, “Sergei L'vovich Sobolev”, Sibirsk. Mat. Zh., 44:5 (2003), 953–960
59.
Goncharov S.S., Lempp S., Solomon R., “THE COMPUTABLE DIMENSION OF ORDERED ABELIAN GROUPS”, Advances in Mathematics, 175:1 (2003), http://www.sciencedirect.com/science/article/pii/S0001870802000427, 41 pp. http://www.sciencedirect.com/science/article/pii/S0001870802000427
Goncharov S.S., Harizanov V.S., Laskowski M.C., Lempp S., McCoy C.F.D., “TRIVIAL, STRONGLY MINIMAL THEORIES ARE MODEL COMPLETE AFTER NAMING CONSTANTS”, Proceedings of the American Mathematical Society, 131:12 (2003), 3901-3912
Serikzhan Badaev, Sergey Goncharov, Andrea Sorbi, “Completeness and Universality of Arithmetical Numberings”, Computability and Models The University Series in Mathematics, Springer, 2003, 11-44
62.
S. S. Goncharov, V. S. Harizanov, J. F. Knight, C. F. D. McCoy, “Simple and immune relations on countable structures”, Arch. Math. Logic, 42:3 (2003), 279–291
Goncharov, SS; Khusainov, BK, “Complexity of categorical theories with computable models”, Doklady Mathematics, 66:1 (2002), 52-54 pp.
67.
Goncharov, SS; Khusainov, BK, “Complexity of categorical theories with computable models”, Doklady Mathematics, 66:1 (2002), 5 pp.
68.
S. A. Badaev, S. S. Goncharov, “Rogers Semilattices of Families of Arithmetic Sets”, Algebra and Logic, 40:5 (2001), 283–291
69.
M. M. Lavrent'ev, V. L. Beresnev, A. A. Borovkov, S. K. Godunov, S. S. Goncharov, Yu. L. Ershov, S. S. Kutateladze, P. I. Plotnikov, Yu. G. Reshetnyak, V. G. Romanov, “Mikhail Alekseevich Lavrent'ev (on the centenary of his birth)”, Sibirsk. Mat. Zh., 41:5 (2000), 969–983
70.
M. M. Lavrent'ev, V. L. Beresnev, A. A. Borovkov, S. K. Godunov, S. S. Goncharov, V. D. Mazurov, S. S. Kutateladze, Yu. G. Reshetnyak, V. G. Romanov, “Yurii Leonidovich Ershov (on the occasion of his sixtieth birthday)”, Sibirsk. Mat. Zh., 41:2 (2000), 243–246http://www.researcherid.com/rid/J-7221-2013
71.
Cholak, P; Goncharov, S; Khoussivnov, B; et al., “Computably categorical structures and expansions by constants Volume: 64 Issue: 1 Pages: 13-37 Published: MAR 1999”, Journal of Symbolic Logic, 64:1 (1999), 24 pp.
CONSTRUCTIVE MODELS Ershov Yu.L., Goncharov S.S., “CHAPTER 2 ELEMENTARY THEORIES AND THEIR”, Studies in Logic and the Foundations of Mathematics, 138 (1998), http://www.sciencedirect.com/science/article/pii/S0049237X98800037, 115-165 pp. http://www.sciencedirect.com/science/article/pii/S0049237X98800037
Goncharov, SS, “Decidable Boolean algebras of low level”, Annals of Pure and Applied Logic, 94:1-3 (1998), http://www.sciencedirect.com/science/article/pii/S0168007297000687, 20 pp.
74.
Goncharov S.S., “Chapter 6 Autostable models and algorithmic dimensions Original Volume 138, 1998,”, Studies in Logic and the Foundations of Mathematics, 138 (1998), http://www.sciencedirect.com/science/article/pii/S0049237X98800074, 17 pp.
75.
Y.L. Ershov, S.S. Goncharov, A. Nerode, J.B. Remmel, “Introduction to the handbook of Recursive Mathematics”, Studies in Logic and the Foundations of Mathematics, 138 (1998), http://www.sciencedirect.com/science/article/pii/S0049237X98800013, vii-xlvi pp.
76.
Y.L. Ershov, S.S. Goncharov, A. Nerode, J.B. Remmel, “Introduction to the handbook of recursive mathematics”, Studies in Logic and the Foundations of Mathematics, 139 (1998), vii-xlvi
77.
S. S. Goncharov, S. A. Badaev, “Families with one-element Rogers semilattice”, Algebra and Logic, 37:1 (1998), 21–34
78.
Goncharov S.S., Khusainov B., “ON THE SPECTRUM OF DEGREES OF DECIDABLE RELATIONS”, Doklady Mathematics, 55:1 (1997), 7 pp.
79.
Goncharov, SS; Khusainov, B, “On degrees spectra of decidable relations”, Doklady Akademii Nauk, 352:3 (1997), 301-303
80.
S. S. Goncharov, A. Sorbi, “Generalized computable numerations and nontrivial Rogers semilattices”, Algebra and Logic, 36:6 (1997), 359–369
81.
Badaev, SA; Goncharov, SS; Ershov, YL; et al., “On computable minimal enumerations”, Algebra, 1996, 21-33 pp.
82.
S. S. Goncharov, M. Pourmahdian, “Iterated expansions of models for countable theories and their applications”, Algebra and Logic, 34:6 (1995), 346–358
83.
S. S. Goncharov, “A unique positive enumeration”, Siberian Adv. Math., 4:1 (1994), 52–64
84.
S. S. Goncharov, “Computable classes of constructivizations for models of finite computability type”, Siberian Math. J., 34:5 (1993), 812–824
85.
GONCHAROV, SS, “POSITIVE COMPUTABLE ENUMERATIONS”, Doklady Akademii Nauk, 332:2 (1993), 2 pp.
86.
Goncharov S. S., “Effectively infinite classes of weak constructivizations of models”, Algebra and Logic Plenum Publ.Corp.,, 32:6 (1993), 342-360
S. S. Goncharov, A. Yakhnis, V. Yakhnis, “Effectively infinite classes of enumerations”, Siberian Adv. Math., 3:1 (1993), 94–120
89.
V. N. Vlasov, S. S. Goncharov, “Strong constructibility of Boolean algebras of elementary characteristic $(1,1,0)$”, Algebra and Logic, 32:6 (1993), 334–341
90.
S. S. Goncharov, “Positive computable enumerations”, Dokl. Math., 48:2 (1994), 268–270
91.
S. S. Goncharov, “Semeistva s edinstvennoi pozitivnoi numeratsiei”, Vychisl. sistemy, 146 (1992), 96–104
92.
S. S. Goncharov, “Ob odnom sposobe effektivnoi realizatsii programm v semanticheskom programmirovanii”, Vychisl. sistemy, 139 (1991), 117–123
93.
S. S. Goncharov, A. V. Molokov, N. S. Romanovskii, “Nilpotent groups of finite algorithmic dimension”, Siberian Mathematical Journal, 30:1 (1989), 6 pp.
94.
S. S. Goncharov, “The characterization of axiomatizable classes with strong epimorphisms”, Sib. Adv. Math., 1:2 (1991), 57–76
95.
S. S. Goncharov, B. N. Drobotun, “Algorithmic dimension of nilpotent groups”, Siberian Math. J., 30:2 (1989), 210–217
96.
S. S. Goncharov, D. I. Sviridenko, “Logicheskoe programmirovanie v shirokom smysle”, Vychisl. sistemy, 129 (1989), 3–48
97.
S. S. Goncharov, “Characterization of axiomatizable classes with strong epimorphisms”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 12 (1989), 24–39
98.
S. S. Goncharov, “Semeistvo s edinstvennoi odnoznachnoi, no ne naimenshei numeratsiei”, Tr. In-ta matematiki SO AN SSSR, 8 (1988), 42–58
99.
S. S. Goncharov, “A family with a unique univalent but not least numeration”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 8 (1988), 42–58
100.
Yu. L. Ershov, S. S. Goncharov, D. I. Sviridenko, “Semantic foundations of programming”, Lecture Notes in Computer Science, 278 (1987), 116-122
S. S. Goncharov, “Axiomatizable classes with strong homomorphisms”, Studia Logica, 46:2 (1987), 113–120
102.
S. S. Goncharov, V. D. Dzgoev, “Pozitivnye modeli i abstraktnye tipy dannykh”, Vychisl. sistemy, 122 (1987), 47–58
103.
S. S. Goncharov, D. I. Sviridenko, “$\Sigma^{+}$-programmy i ikh semantiki”, Vychisl. sistemy, 120 (1987), 24–51
104.
S. S. Goncharov, D. I. Sviridenko, “Theoretical aspects of $\Sigma$-programming”, Lecture Notes in Computer Science, 215 (1986), 10 pp.
105.
S. S. Goncharov, D. I. Sviridenko, “Mathematical principles of semantic programming”, Doklady Akademii Nauk SSSR, 289:6 (1986), 1324-1328
106.
S. S. Goncharov, “Teoriya spiskov i ee modeli”, Vychisl. sistemy, 114 (1986), 84–95
107.
S. S. Goncharov, “Zamechanie ob aksiomakh spisochnoi nadstroiki GES”, Vychisl. sistemy, 114 (1986), 11–15
108.
S. S. Goncharov, “Ob aksiomakh dlya klassov s silnymi gomomorfizmami”, Vychisl. sistemy, 116 (1986), 140–155
109.
C. J. Ash, S. S. Goncharov, “Strong $\Delta^0_2$-categoricity”, Algebra and Logic, 24:6 (1985), 471–476
110.
S. S. Goncharov, “Axioms for classes with strong epimorphisms”, Proceedings of the third Easter conference on model theory (Gross Köris, 1985), Seminarberichte, 70, Humboldt Univ., Berlin, 1985, 99–102
111.
S. S. Goncharov, “Strongly constructive models”, Proceedings of the third Easter conference on model theory (Gross Köris, 1985), Seminarberichte, 70, Humboldt Univ., Berlin, 1985, 103–114
112.
S. S. Goncharov, “Data models and languages for their description”, Am. Math. Soc. Translations – Series 2, 143 (1989), 139–152
113.
S. S. Goncharov, D. I. Sviridenko, “$\Sigma$-programming”, Am. Math. Soc. Translations – Series 2, 142 (1989), 101–121
114.
S. S. Goncharov, A. A. Novikov, “Examples of nonautostable systems”, Siberian Math. J., 25:4 (1984), 538–545
115.
S. S. Goncharov, “Universal recursively enumerable Boolean algebras”, Siberian Math. J., 24:6 (1983), 852–858
116.
S. S. Goncharov, “Positive numerations of families with one-valued numerations”, Algebra and Logic, 22:5 (1983), 345–350
117.
S. S. Goncharov, “Predelno ekvivalentnye konstruktivizatsii”, Tr. In-ta matematiki SO AN SSSR, 2, Institut matematiki SO AN SSSR, 1982, 4–12
118.
S. S. Goncharov, “Limit equivalent constructivizations”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 2 (1982), 4–12
119.
S. S. Goncharov, “Groups with a finite number of constructivizations”, Soviet Math. Dokl., 23:2 (1981), 4 pp.
120.
S. S. Goncharov, “Groups with a finite number of constructivizations”, Dokl. Akad. Nauk SSSR, 256:2 (1981), 269–272
121.
S. S. Goncharov, “Totally transcendental theory with a nonconstructivizable prime model”, Siberian Math. J., 21:1 (1980), 32–37
122.
S. S. Goncharov, “The problem of the number of nonautoequivalent constructivizations”, Soviet. Math. Dokl., 21 (1980), 411-414 pp.
123.
S. S. Goncharov, B. N. Drobotun, “Numerations of saturated and homogeneous models”, Siberian Math. J., 21:2 (1980), 164–176
124.
S. S. Goncharov, “Autostability of models and Abelian groups”, Algebra and Logic, 19:1 (1980), 13–27
125.
S. S. Goncharov, V. D. Dzgoev, “Autostability of models”, Algebra and Logic, 19:1 (1980), 28–37
126.
S. S. Goncharov, “A totally transcendental decidable theory without constructivizable homogeneous models”, Algebra and Logic, 19:2 (1980), 85–93
127.
S. S. Goncharov, “Computable single-valued numerations”, Algebra and Logic, 19:5 (1980), 325–356
128.
S. S. Goncharov, “Problem of the number of non-self-equivalent constructivizations”, Algebra and Logic, 19:6 (1980), 401–414
129.
S. S. Goncharov, “The problem of the number of nonautoequivalent constructivizations”, Dokl. Akad. Nauk SSSR, 251:2 (1980), 271–274
130.
S. S. Goncharov, “Constructive models of $\aleph_1$-categorical theories”, Math. Notes, 23:6 (1978), 486–487
131.
S. S. Goncharov, “Strong constructivizability of homogeneous models”, Algebra and Logic, 17:4 (1978), 247–263
132.
S. S. Goncharov, “The quantity of nonautoequivalent constructivizations”, Algebra and Logic, 16:3 (1977), 169–185
133.
S. S. Goncharov, “Non-self-equivalent constructivization of atomic Boolean algebras”, Math. Notes, 19:6 (1976), 500–503
134.
S. S. Goncharov, “Restricted theories of constructive Boolean algebras”, Siberian Math. J., 17:4 (1976), 601–611
135.
S. S. Goncharov, “Autostability and computable families of constructivizations”, Algebra and Logic, 14:6 (1975), 392–409
136.
S. S. Goncharov, “Some properties of the constructivization of Boolean algebras”, Siberian Math. J., 16:2 (1975), 203–214
137.
S. S. Goncharov, “Constructivizability of superatomic Boolean algebras”, Algebra and Logic, 12:1 (1974), 6 pp.
138.
S. S. Goncharov, A. T. Nurtazin, “Constructive models of complete solvable theories”, Algebra and Logic, 12:2 (1974), 11 pp.
139.
S. S. Goncharov, A. T. Nurtazin, Algebra Logika, 12:2 (1973), 125–142
140.
S. S. Goncharov, Algebra Logika, 12:1 (1973), 31–40
Books
141.
Goncharov S.S., Drobotun B.N., Nikitin A.A., OSNOVANIYa DIDAKTIKI OBUChENIYa LOGIKO-ALGEBRAIChESKIM DISTsIPLINAM V VYSShEI ShKOLE monografiya : v 2 ch. / S. S. Goncharov, B. N. Drobotun, A. A. Nikitin, Ch.1 : Nauchno-teoreticheskie i ideino-metodologicheskie predposylki / Uchrezhdenie Ros. akad. obrazovaniya “In-t ped. issled. odarennosti detei”, Izd-vo IPIO RAO, Novosibirsk, 2011, 269 pp., Osnovaniya didaktiki obucheniya logiko-algebraicheskim distsiplinam v vysshei shkole [Tekst] : [monografiya : v 2 ch.] / S. S. Goncharov, B. N. Drobotun, A.A. Nikitin ; . - - 2011. -s. : il. - Bibliogr.: s. 258-264 . - http://elibrary.ru/item.asp?id=19465508
142.
Ershov Yu. L., Goncharov S. S., Konstruktivnye modeli, (Sibirskaya shkola algebry i logiki), Nauchnaya kniga, Novosibirsk, 1999, 360 pp.
143.
Goncharov S. S., Countable Boolean algebras and decidability, Siberian School of Algebra and Logic, NY: Plenum. XII, Siberian School of Algebra and Logic, New-York, NY: Plenum. xii, New-York, 1997, 318 s. pp.
144.
Goncharov, Sergei S., Countable Boolean Algebras and Decidability, Algebraic Properties of Boolean Algebras. Elementary Classification of Boolean Algebras. Constructive Boolean Algebras. Index., Siberian School of Algebra and Logic, Springer, 1997 http://www.springer.com/mathematics/algebra/book/978-0-306-11061-0
145.
Goncharov S. S., Schetnye bulevy algebry i razreshimost, Sibirskaya shkola algebry i logiki, Nauchnaya kniga, Novosibirsk, 1996, 373 pp.
Thesis
146.
S. S. Goncharov, Konstruktivnye bulevy algebry, dissertatsiya kandidata fiziko-matematicheskikh nauk, Izdatelstvo Instituta matematiki SO AN SSSR, Novosibirsk, 1974, 121 pp.
Popular science or education materials
147.
S. S. Goncharov, V. D. Dzgoev, K. F. Samokhvalov and D. I. Sviridenko., Handbook of mathematical logic. Part I. Model theory, Translation edited and with a preface by Yu. L. Ershov, E. A. Palyutin and A. D. Taǐmanov. With a supplement by Palyutin., Nauka, Moscow, 1982, 392 pp.
Information matherials
148.
Yu. L. Ershov, S. S. Goncharov, V. D. Mazurov, B. S. Baizhanov, B. Sh. Kulpeshov, P. E. Alaev, A. V. Vasil'ev, E. V. Vasil'ev, E. P. Vdovin, V. V. Verbovskii, A. A. Vikent'ev, D. Yu. Vlasov, M. A. Grechkoseeva, V. N. Zhelyabin, P. S. Kolesnikov, V. M. Kopytov, L. L. Maksimova, I. A. Mal'tsev, A. S. Morozov, A. A. Nikitin, E. V. Ovchinnikova, S. P. Odintsov, D. E. Pal'chunov, N. A. Peryazev, A. G. Pinus, L. N. Pobedin, A. P. Pozhidaev, B. Poizat, V. G. Puzarenko, D. O. Revin, V. N. Remeslennikov, N. S. Romanovskii, A. N. Ryaskin, S. S. Starchenko, A. A. Stepanova, S. V. Sudoplatov, E. I. Timoshenko, D. A. Tusupov, N. G. Khisamiev, V. A. Churkin, Z. Chatzidakis, M. V. Schwidefsky, K. M. Shegirov, I. P. Shestakov, “Evgenii Andreevich Palyutin (1945–2018)”, Sib. Èlektron. Mat. Izv., 16 (2019), 1–10
149.
P. E. Alaev, O. V. Bogopolski, A. V. Vasil'ev, S. S. Goncharov, Yu. L. Ershov, V. D. Mazurov, L. L. Maksimova, A. S. Morozov, S. P. Odintsov, D. E. Palchunov, V. G. Puzarenko, V. V. Rybakov, K. L. Rychkov, A. N. Ryaskin, I. A. Taimanov, A. S. Filyurin, D. G. Khramtsov, V. A. Churkin, “Sergei Ilyich Mardaev (6.04.1962–10.04.2013)”, Sib. Èlektron. Mat. Izv., 10 (2013), 30–34
150.
S. S. Goncharov, A. S. Morozov, S. P. Odintsov, “9th Asian Logic Conference, Novosibirsk, Russia, 16–19 August 2005”, Sib. Èlektron. Mat. Izv., 2 (2005), 10–11
Personalia
151.
A. I. Avetisyan, N. Yu. Anisimov, L. D. Beklemishev, A. Ya. Belov, A. V. Gasnikov, S. S. Goncharov, Yu. L. Ershov, S. N. Kalmykov, V. V. Kozlov, G. Ya. Krasnikov, Yu. V. Matiyasevich, M. R. Pentus, M. A. Posypkin, A. M. Raigorodskii, I. M. Remorenko, T. A. Rudchenko, S. F. Soprunov, S. V. Tarasov, A. Yu. Uvarov, M. V. Shamolin, A. I. Shafarevich, A. Kh. Shen, “Alexei Lvovich Semenov (on his 75th birthday)”, Russian Math. Surveys, 81:3 (2026), 563–57
