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.
V. S. Atabekyan, L. D. Beklemishev, V. M. Buchstaber, S. S. Goncharov, V. S. Guba, Yu. L. Ershov, V. V. Kozlov, I. G. Lysenok, S. P. Novikov, Yu. S. Osipov, M. R. Pentus, V. V. Podolskii, A. A. Razborov, V. A. Sadovnichii, A. L. Semenov, A. L. Talambutsa, D. V. Treschev, L. N. Shevrin, “Sergei Ivanovich Adian (obituary)”, Russian Math. Surveys, 76:1 (2021), 177–181
2020
2.
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;
3.
L. D. Beklemishev, A. V. Vasil'ev, E. P. Vdovin, S. S. Goncharov, V. V. Kozlov, P. S. Kolesnikov, V. D. Mazurov, Yu. V. Matiyasevich, A. S. Morozov, A. N. Parshin, V. G. Puzarenko, M. V. Schwidefsky, “Yurii Leonidovich Ershov (on his 80th birthday)”, Russian Math. Surveys, 75:3 (2020), 581–585
2019
4.
Goncharov S.S., Sviridenko D.I., “Logical Language of Description of Polynomial Computing”, Doklady Mathematics, 99:2 (2019), 121–124 (cited: 1) (cited: 3)
5.
S. S. Goncharov, R. Miller, V. Harizanov, “Turing degrees of complete formulas of almost prime models”, Algebra and Logic, 58:3 (2019), 282–287 (cited: 2)
6.
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
7.
S. I. Adian, N. N. Andreev, L. D. Beklemishev, S. S. Goncharov, Yu. L. Ershov, Yu. V. Matiyasevich, Yu. S. Osipov, M. R. Pentus, V. A. Plungyan, E. V. Rakhilina, V. A. Sadovnichii, A. L. Semenov, S. G. Tatevosov, V. M. Tikhomirov, A. Kh. Shen, “Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)”, Russian Math. Surveys, 74:4 (2019), 735–753
2018
8.
S. S. Goncharov, D. I. Sviridenko, “Recursive terms in semantic programming”, Siberian Math. J., 59:6 (2018), 1014–1023 (cited: 3) (cited: 5)
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
2017
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 (cited: 1) (cited: 4)
11.
S. S. Goncharov, “Conditional terms in semantic programming”, Siberian Math. J., 58:5 (2017), 794–800 (cited: 8) (cited: 9)
2015
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 (cited: 3) (cited: 4)
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 (cited: 6)
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 (cited: 6) (cited: 6) (cited: 1) (cited: 1) (cited: 10)
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 (cited: 1)
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) (cited: 3)
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)
2017
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
2015
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 (cited: 1) (cited: 2)
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 (cited: 6) (cited: 8)
21.
S. S. Goncharov, V. D. Mazurov, L. L. Maksimova, A. S. Morozov, E. P. Vdovin, A. V. Vasil'ev, E. A. Palyutin, A. A. Nikitin, M. V. Schwidefsky, L. A. Bokut', I. P. Shestakov, E. I. Khukhro, “Yurii Leonidovich Ershov (on the occasion of his 75th birthday)”, Sibirsk. Mat. Zh., 56:3 (2015), 477–480
2014
22.
S. A. Badaev, S. S. Goncharov, “Generalized computable universal numberings”, Algebra and Logic, 53:5 (2014), 355–364 (cited: 10)
2015
23.
S. S. Goncharov, “Index Sets of Almost Prime Constructive Models”, J. Math. Sci., 205:3 (2015), 355–367 (cited: 1)
24.
S. S. Goncharov, M. I. Marchuk, “Index Sets of Autostable Relative to Strong Constructivizations Constructive Models”, J. Math. Sci., 205:3 (2015), 368–388 (cited: 1) (cited: 1)
2013
25.
S. S. Goncharov, Yu. L. Ershov, V. M. Levchuk, V. D. Mazurov, V. I. Senashov, A. I. Sozutov, N. S. Chernikov, “Vladimir Petrovich Shunkov (obituary)”, Russian Math. Surveys, 68:4 (2013), 769–771
26.
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
2012
27.
Goncharov S. S., “Problems of autostability and spectrum of autostability”, The Bulletin of Symbolic Logic, 18:3 (2012), 422-423
2011
28.
S. S. Goncharov, “Degrees of autostability relative to strong constructivizations”, Proc. Steklov Inst. Math., 274 (2011), 105–115 http://link.springer.com/article/10.1134/S0081543811060071 (cited: 13) (cited: 1) (cited: 1) (cited: 13)
29.
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
30.
Ivanisenko V.A., Podkolodnyi N.L., Demenkov P.S., Ivanisenko T.V., Podkolodnaya O.A., Ignateva E.V., Khlebodarova T.M., Podkolodnaya N.N., Ananko E.A., Goncharov S.S., Kolchanov N., “IZVLEChENIE ZNANII IZ TEKSTOV NAUChNYKh PUBLIKATsII I SOZDANIE BAZ ZNANII V OBLASTI NANOBIOTEKhNOLOGII”, Rossiiskie nanotekhnologii, 6:7-8 (2011) , 7 pp. (cited: 1)
31.
Goncharov S.S., Drobotun B.N., Nikitin A.A., “K PROBLEME FORMIROVANIYa I RAZVITIYa FUNDAMENTALNYKh OSNOV LOGIChESKOGO OBRAZOVANIYa V SREDNEI OBSchEOBRAZOVATELNOI ShKOLE (II)”, Pedagogicheskie zametki, 4:2 (2011) , 17 pp.
A. A. Borovkov, S. K. Godunov, S. S. Goncharov, A. N. Konovalov, I. A. Lavrov, V. D. Mazurov, L. L. Maksimova, A. A. Mal'tsev, B. G. Mikhailenko, A. S. Morozov, A. A. Nikitin, E. A. Palyutin, Yu. G. Reshetnyak, “Yurii Leonidovich Ershov (on his seventieth birthday)”, Russian Math. Surveys, 66:1 (2011), 199–203
2010
34.
S. S. Goncharov, “On autostability of almost prime models relative to strong constructivizations”, Russian Math. Surveys, 65:5 (2010), 901–935 (cited: 5) (cited: 5)
35.
Goncharov S.S., Drobotun B.N., Nikitin A.A., “K PROBLEME FORMIROVANIYa I RAZVITIYa FUNDAMENTALNYKh OSNOV LOGIChESKOGO OBRAZOVANIYa V SREDNEI OBSchEOBRAZOVATELNOI ShKOLE (I)”, Pedagogicheskie zametki, 3 (2010) , 13 pp.
36.
Downey, Rodney G.; Goncharov, Sergei S.; Kach, Asher M.; et al., “Decidability and Computability of Certain Torsion-Free Abelian Groups”, Notre Dame Journal of Formal Logic, 51:1 (2010) , 11 pp. http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.ndjfl/1273002111 (cited: 7)
37.
S. S. Goncharov, A. G. Kusraev, S. S. Kutateladze, I. A. Lavrov, V. D. Mazurov, A. S. Morozov, M. V. Semenova, “Yurii Leonidovich Ershov (on his seventieth birthday)”, Vladikavkaz. Mat. Zh., 12:2 (2010), 75–78
2009
38.
S. S. Goncharov, “Autostability of prime models under strong constructivizations”, Algebra and Logic, 48:6 (2009), 410–417 (cited: 4) (cited: 3) (cited: 3) (cited: 5)
39.
Chisholm J., Fokina E.B., Goncharov S.S., Harizanov V.S., Knight J.F., Quinn S., “INTRINSIC BOUNDS ON COMPLEXITY AND DEFINABILITY AT LIMIT LEVELS”, Journal of Symbolic Logic, 74:3 (2009), 1047-1060 http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.jsl/1245158098 (cited: 15) (cited: 17)
40.
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 (cited: 3) (cited: 1)
41.
Goncharov S.S., LEKTsII PO MATEMATIChESKOI LOGIKE uchebnoe posobie dlya studentov vysshikh uchebnykh zavedenii, obuchayuschikhsya po napravleniyu podgotovki vysshego professionalnogo obrazovaniya 010100 Matematika i spetsialnosti 010101 Matematika : [v 2 ch.] / S. S. Goncharov ;, Federalnoe agentstvo po obrazovaniyu, Novosibirskii gos. un-t, Mekhaniko-mat. fak.. Novosibirsk,, 2009
2008
42.
S. A. Badaev, S. S. Goncharov, A. Sorbi, “Some remarks on completion of numberings”, Siberian Math. J., 49:5 (2008), 780–783
43.
S. S. Goncharov, “On two problems of Turing complexity for strongly minimal theories”, Dokl. Math., 77:3 (2008), 438–440
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
51.
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
52.
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
2007
53.
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 (cited: 12) (cited: 4) (cited: 10)
54.
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-216 http://link.springer.com/chapter/10.1007/978-0-387-69245-6_3
55.
Goncharov S.S., MATEMATIChESKAYa LOGIKA uchebnoe posobie, / S. S. Goncharov ; Federalnoe agentstvo po obrazovaniyu, Novosibirskii gos. un-t, Mekh.-mat. fak.. Novosibirsk, Tom Ch. 1, 2007
2006
56.
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 (cited: 11)
57.
S. S. Goncharov, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., mech. and informatics, 6:3 (2006), 3–4
58.
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
2005
59.
S. A. Badaev, S. S. Goncharov, A. Sorbi, “Elementary Theories for Rogers Semilattices”, Algebra and Logic, 44:3 (2005), 143–147 (cited: 3) (cited: 8)
60.
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 (cited: 4) (cited: 4)
61.
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. (cited: 52) (cited: 55)
62.
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
2004
63.
S. S. Goncharov, B. Khoussainov, “Complexity of Categorical Theories with Computable Models”, Algebra and Logic, 43:6 (2004), 365–373 (cited: 19)
64.
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
65.
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 (cited: 16) (cited: 11) (cited: 13)
2003
66.
S. S. Goncharov, R. Downey, D. Hirschfeldt, “Degree Spectra of Relations on Boolean Algebras”, Algebra and Logic, 42:2 (2003), 105–111 (cited: 9)
67.
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
68.
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 (cited: 22) (cited: 15)
69.
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 (cited: 14) (cited: 13) (cited: 14)
70.
Serikzhan Badaev, Sergey Goncharov, Andrea Sorbi, “Completeness and Universality of Arithmetical Numberings”, Computability and Models The University Series in Mathematics, Springer, 2003, 11-44
71.
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 (cited: 1) (cited: 2)
72.
S. S. Goncharov, A. E. Gutman, Yu. L. Ershov, S. S. Kutateladze, V. L. Makarov, A. M. Nakhushev, Yu. G. Reshetnyak, V. M. Tikhomirov, G. N. Shotaev, “Anatoliĭ Georgievich Kusraev (on the occasion of his fiftieth birthday)”, Vladikavkaz. Mat. Zh., 5:1 (2003), 5–7
73.
[A.A. Nikiti, I.V. Silantev, S.S. Goncharov i dr., SPETsIALIZIROVANNOE OBRAZOVANIE, Pod red. A.A. Nikitina i I.V. Silanteva; Predisl. N.L. Dobretsova; M-vo obrazovaniya Ros. Federatsii, Novosib. gos. un-t. Spetsializir. ucheb.-nauch. tsentr fiz.-mat. i khim.-biol. profilya. Novosibirsk,, 2003
2002
74.
S. S. Goncharov, J. F. Knight, “Computable Structure and Non-Structure Theorems”, Algebra and Logic, 41:6 (2002), 351–373 (cited: 73)
75.
S. S. Goncharov, S. Lempp, R. Solomon, “Friedberg Numberings of Families of $n$-Computably Enumerable Sets”, Algebra and Logic, 41:2 (2002), 81–86 (cited: 20)
Goncharov, SS; Khusainov, BK, “Complexity of categorical theories with computable models”, Doklady Mathematics, 66:1 (2002) , 52-54 pp. (cited: 1)
78.
Goncharov, SS; Khusainov, BK, “Complexity of categorical theories with computable models”, Doklady Mathematics, 66:1 (2002) , 5 pp.
2001
79.
S. A. Badaev, S. S. Goncharov, “Rogers Semilattices of Families of Arithmetic Sets”, Algebra and Logic, 40:5 (2001), 283–291 (cited: 11)
80.
M. M. Lavrent'ev, V. L. Beresnev, I. S. Borisov, S. K. Godunov, S. S. Goncharov, Yu. L. Ershov, A. A. Mogul'skii, S. S. Kutateladze, Yu. G. Reshetnyak, V. G. Romanov, “Aleksandr Alekseevich Borovkov (on the occasion of his seventieth birthday)”, Sibirsk. Mat. Zh., 42:2 (2001), 243–248
2000
81.
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
82.
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–246 http://www.researcherid.com/rid/J-7221-2013
83.
S. S. Goncharov, I. A. Lavrov, V. D. Mazurov, A. A. Mal'tsev, A. S. Morozov, A. A. Nikitin, E. A. Palyutin, D. M. Smirnov, “Yuri Leonidovich Ershov (on his 60th birthday)”, Russian Math. Surveys, 55:6 (2000), 1193–1204
84.
S. S. Goncharov, I. A. Lavrov, V. D. Mazurov, A. A. Maltsev, A. A. Nikitin, A. S. Morozov, E. A. Palyutin, D. M. Smirnov, “Yurii Leonidovich Ershov (k shestidesyatiletiyu so dnya rozhdeniya)”, Vladikavk. matem. zhurn., 2:2 (2000), 3–9
1999
85.
Ershov Yu. L., Goncharov S. S., Konstruktivnye modeli, (Sibirskaya shkola algebry i logiki), Nauchnaya kniga, Novosibirsk, 1999 , 360 pp.
86.
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. (cited: 22)
1998
87.
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 (cited: 1)
88.
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.
89.
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.
90.
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.
91.
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
92.
S. S. Goncharov, S. A. Badaev, “Families with one-element Rogers semilattice”, Algebra and Logic, 37:1 (1998), 21–34 (cited: 1)
1997
93.
Goncharov S.S., Khusainov B., “ON THE SPECTRUM OF DEGREES OF DECIDABLE RELATIONS”, Doklady Mathematics, 55:1 (1997) , 7 pp. (cited: 6)
94.
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.
95.
Goncharov, SS; Khusainov, B, “On degrees spectra of decidable relations”, Doklady Akademii Nauk, 352:3 (1997), 301-303 (cited: 3)
96.
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
97.
S. S. Goncharov, A. Sorbi, “Generalized computable numerations and nontrivial Rogers semilattices”, Algebra and Logic, 36:6 (1997), 359–369 (cited: 48)
1996
98.
Goncharov S. S., Schetnye bulevy algebry i razreshimost, Sibirskaya shkola algebry i logiki, Nauchnaya kniga, Novosibirsk, 1996 , 373 pp.
99.
Badaev, SA; Goncharov, SS; Ershov, YL; et al., “On computable minimal enumerations”, Algebra, 1996 , 21-33 pp.
1995
100.
S. S. Goncharov, M. Pourmahdian, “Iterated expansions of models for countable theories and their applications”, Algebra and Logic, 34:6 (1995), 346–358
1994
101.
S. S. Goncharov, “A unique positive enumeration”, Siberian Adv. Math., 4:1 (1994), 52–64
1993
102.
S. S. Goncharov, “Computable classes of constructivizations for models of finite computability type”, Siberian Math. J., 34:5 (1993), 812–824 (cited: 2)
103.
GONCHAROV, SS, “POSITIVE COMPUTABLE ENUMERATIONS”, Doklady Akademii Nauk, 332:2 (1993) , 2 pp.
104.
Goncharov S. S., “Effectively infinite classes of weak constructivizations of models”, Algebra and Logic Plenum Publ.Corp.,, 32:6 (1993), 342-360 (cited: 4)
105.
S. Goncharov, A. Yakhnis; V. Yakhnis, “Some effectively infinite classes of enumerations”, Annals of Pure and Applied Logic, 60:3 (1993) , 18 pp. http://www.sciencedirect.com/science/article/pii/016800729390076P (cited: 3)
106.
S. S. Goncharov, A. Yakhnis, V. Yakhnis, “Effectively infinite classes of enumerations”, Siberian Adv. Math., 3:1 (1993), 94–120
107.
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 (cited: 7)
1994
108.
S. S. Goncharov, “Positive computable enumerations”, Dokl. Math., 48:2 (1994), 268–270
1992
109.
S. S. Goncharov, “Semeistva s edinstvennoi pozitivnoi numeratsiei”, Vychisl. sistemy, 146 (1992), 96–104
1991
110.
S. S. Goncharov, “Ob odnom sposobe effektivnoi realizatsii programm v semanticheskom programmirovanii”, Vychisl. sistemy, 139 (1991), 117–123
1990
111.
S. S. Goncharov, Yu. L. Ershov, M. M. Lavrent'ev, L. L. Maksimova, T. G. Mustafin, S. P. Novikov, E. A. Palyutin, M. G. Peretyat'kin, Yu. G. Reshetnyak, D. M. Smirnov, “Asan Dabsovich Taimanov (obituary)”, Russian Math. Surveys, 45:5 (1990), 213–215 (cited: 1)
1989
112.
S. S. Goncharov, A. V. Molokov, N. S. Romanovskii, “Nilpotent groups of finite algorithmic dimension”, Siberian Mathematical Journal, 30:1 (1989) , 6 pp. (cited: 15) (cited: 18)
1991
113.
S. S. Goncharov, “The characterization of axiomatizable classes with strong epimorphisms”, Sib. Adv. Math., 1:2 (1991), 57–76
1989
114.
S. S. Goncharov, B. N. Drobotun, “Algorithmic dimension of nilpotent groups”, Siberian Math. J., 30:2 (1989), 210–217 (cited: 2) (cited: 3)
115.
S. S. Goncharov, D. I. Sviridenko, “Logicheskoe programmirovanie v shirokom smysle”, Vychisl. sistemy, 129 (1989), 3–48
116.
S. S. Goncharov, “Characterization of axiomatizable classes with strong epimorphisms”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 12 (1989), 24–39
117.
A. T. Gainov, S. S. Goncharov, Yu. L. Ershov, Д. А. Захаров, E. N. Kuz'min, L. L. Maksimova, Yu. I. Merzlyakov, D. M. Smirnov, A. D. Taimanov, V. K. Kharchenko, E. I. Khukhro, Algebra Logika, 28:6 (1989), 615–618
118.
A. D. Bol'bot, S. S. Goncharov, V. A. Gorbunov, Yu. L. Ershov, E. N. Kuz'min, V. D. Mazurov, Yu. I. Merzlyakov, E. A. Palyutin, V. K. Kharchenko, E. I. Khukhro, “Dmitriĭ Matveevich Smirnov (on the occasion of his seventieth birthday)”, Algebra Logika, 28:5 (1989), 491–492
1988
119.
S. S. Goncharov, “Semeistvo s edinstvennoi odnoznachnoi, no ne naimenshei numeratsiei”, Tr. In-ta matematiki SO AN SSSR, 8 (1988), 42–58
120.
S. S. Goncharov, “A family with a unique univalent but not least numeration”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 8 (1988), 42–58
1987
121.
Yu. L. Ershov, S. S. Goncharov, D. I. Sviridenko, “Semantic foundations of programming”, Lecture Notes in Computer Science, 278 (1987), 116-122 (cited: 11) (cited: 10)
122.
S. S. Goncharov, “Axiomatizable classes with strong homomorphisms”, Studia Logica, 46:2 (1987), 113–120
123.
S. S. Goncharov, V. D. Dzgoev, “Pozitivnye modeli i abstraktnye tipy dannykh”, Vychisl. sistemy, 122 (1987), 47–58
124.
S. S. Goncharov, D. I. Sviridenko, “$\Sigma^{+}$-programmy i ikh semantiki”, Vychisl. sistemy, 120 (1987), 24–51
1986
125.
S. S. Goncharov, D. I. Sviridenko, “Theoretical aspects of $\Sigma$-programming”, Lecture Notes in Computer Science, 215 (1986) , 10 pp. (cited: 9)
126.
S. S. Goncharov, D. I. Sviridenko, “Mathematical principles of semantic programming”, Doklady Akademii Nauk SSSR, 289:6 (1986), 1324-1328 (cited: 3)
127.
S. S. Goncharov, “Teoriya spiskov i ee modeli”, Vychisl. sistemy, 114 (1986), 84–95
128.
S. S. Goncharov, “Zamechanie ob aksiomakh spisochnoi nadstroiki GES”, Vychisl. sistemy, 114 (1986), 11–15
129.
S. S. Goncharov, “Ob aksiomakh dlya klassov s silnymi gomomorfizmami”, Vychisl. sistemy, 116 (1986), 140–155
1985
130.
C. J. Ash, S. S. Goncharov, “Strong $\Delta^0_2$-categoricity”, Algebra and Logic, 24:6 (1985), 471–476 (cited: 3)
131.
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
132.
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
1989
133.
S. S. Goncharov, “Data models and languages for their description”, Am. Math. Soc. Translations – Series 2, 143 (1989), 139–152
134.
S. S. Goncharov, D. I. Sviridenko, “$\Sigma$-programming”, Am. Math. Soc. Translations – Series 2, 142 (1989), 101–121
1984
135.
S. S. Goncharov, A. A. Novikov, “Examples of nonautostable systems”, Siberian Math. J., 25:4 (1984), 538–545 (cited: 2)
1983
136.
S. S. Goncharov, “Universal recursively enumerable Boolean algebras”, Siberian Math. J., 24:6 (1983), 852–858
137.
S. S. Goncharov, “Positive numerations of families with one-valued numerations”, Algebra and Logic, 22:5 (1983), 345–350 (cited: 7)
1982
138.
S. S. Goncharov, “Predelno ekvivalentnye konstruktivizatsii”, Tr. In-ta matematiki SO AN SSSR, 2, Institut matematiki SO AN SSSR, 1982, 4–12
139.
S. S. Goncharov, “Limit equivalent constructivizations”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 2 (1982), 4–12
140.
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.
1981
141.
S. S. Goncharov, “Groups with a finite number of constructivizations”, Soviet Math. Dokl., 23:2 (1981) , 4 pp. (cited: 13)
142.
S. S. Goncharov, “Groups with a finite number of constructivizations”, Dokl. Akad. Nauk SSSR, 256:2 (1981), 269–272
1980
143.
S. S. Goncharov, “Totally transcendental theory with a nonconstructivizable prime model”, Siberian Math. J., 21:1 (1980), 32–37
144.
S. S. Goncharov, “The problem of the number of nonautoequivalent constructivizations”, Soviet. Math. Dokl., 21 (1980) , 411-414 pp.
145.
S. S. Goncharov, B. N. Drobotun, “Numerations of saturated and homogeneous models”, Siberian Math. J., 21:2 (1980), 164–176 (cited: 1) (cited: 5)
146.
S. S. Goncharov, “Autostability of models and Abelian groups”, Algebra and Logic, 19:1 (1980), 13–27 (cited: 51)
147.
S. S. Goncharov, V. D. Dzgoev, “Autostability of models”, Algebra and Logic, 19:1 (1980), 28–37 (cited: 89)
148.
S. S. Goncharov, “A totally transcendental decidable theory without constructivizable homogeneous models”, Algebra and Logic, 19:2 (1980), 85–93 (cited: 8)
149.
S. S. Goncharov, “Computable single-valued numerations”, Algebra and Logic, 19:5 (1980), 325–356 (cited: 23)
150.
S. S. Goncharov, “Problem of the number of non-self-equivalent constructivizations”, Algebra and Logic, 19:6 (1980), 401–414 (cited: 59)
151.
S. S. Goncharov, “The problem of the number of nonautoequivalent constructivizations”, Dokl. Akad. Nauk SSSR, 251:2 (1980), 271–274
1978
152.
S. S. Goncharov, “Constructive models of $\aleph_1$-categorical theories”, Math. Notes, 23:6 (1978), 486–487 (cited: 2)
153.
S. S. Goncharov, “Strong constructivizability of homogeneous models”, Algebra and Logic, 17:4 (1978), 247–263 (cited: 22)
1977
154.
S. S. Goncharov, “The quantity of nonautoequivalent constructivizations”, Algebra and Logic, 16:3 (1977), 169–185 (cited: 38)
1976
155.
S. S. Goncharov, “Non-self-equivalent constructivization of atomic Boolean algebras”, Math. Notes, 19:6 (1976), 500–503 (cited: 2)
156.
S. S. Goncharov, “Restricted theories of constructive Boolean algebras”, Siberian Math. J., 17:4 (1976), 601–611 (cited: 2) (cited: 10)
1975
157.
S. S. Goncharov, “Autostability and computable families of constructivizations”, Algebra and Logic, 14:6 (1975), 392–409 (cited: 54)
158.
S. S. Goncharov, “Some properties of the constructivization of Boolean algebras”, Siberian Math. J., 16:2 (1975), 203–214 (cited: 6) (cited: 30)
1974
159.
S. S. Goncharov, Konstruktivnye bulevy algebry, dissertatsiya kandidata fiziko-matematicheskikh nauk, Izdatelstvo Instituta matematiki SO AN SSSR, Novosibirsk, 1974 , 121 pp.
160.
S. S. Goncharov, “Constructivizability of superatomic Boolean algebras”, Algebra and Logic, 12:1 (1974) , 6 pp. (cited: 23)
161.
S. S. Goncharov, A. T. Nurtazin, “Constructive models of complete solvable theories”, Algebra and Logic, 12:2 (1974) , 11 pp. (cited: 43)
1973
162.
S. S. Goncharov, A. T. Nurtazin, Algebra Logika, 12:2 (1973), 125–142
163.
S. S. Goncharov, Algebra Logika, 12:1 (1973), 31–40
Открытие конференции S. S. Goncharov Междкнародная конференция, посвященная 90-летию со дня рождения Г. И. Марчука "Современные проблемы вычислительной математики и математического моделирования" June 8, 2015 15:00
2021
Terms of Use