Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Goncharov, Sergey Savostyanovich

Total publications: 168 (144)
in MathSciNet: 153 (136)
in zbMATH: 104 (96)
in Web of Science: 60 (51)
in Scopus: 78 (75)
Cited articles: 79
Citations: 1161
Presentations: 5

Number of views:
This page:11283
Abstract pages:26246
Full texts:8972
References:1615
Goncharov, Sergey Savostyanovich
Member of the Russian Academy of Sciences
Professor
Doctor of physico-mathematical sciences (1982)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
Birth date: 24.09.1951
E-mail: ,
Website: https://www.math.nsc.ru/LBRT/logic/persons/gonchar/win.html
Keywords: model; computability; numbering; semantic; elementary theory; algorithmic dimension; computable numbering; decidability; decidable model; hyperarithmetic model; specification; programm; topology; Rodgers semilattice; Ershov and Scott spaces; admissible set; group; field; Boolean algebra; semantic programming.

Subject:

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.

https://www.mathnet.ru/eng/person9178
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/195954
https://elibrary.ru/author_items.asp?spin=3645-1417
https://orcid.org/0000-0001-7465-1189
https://www.webofscience.com/wos/author/record/J-7221-2013
https://www.scopus.com/authid/detail.url?authorId=56377536800

Full list of publications:
| scientific publications | by years | by types | by times cited | common list |


Citations (Crossref Cited-By Service + Math-Net.Ru)

   2022
1. S. A. Badaev, S. S. Goncharov, Algebra Logika, 61:3 (2022), 334–340  mathnet  crossref

   2021
2. 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  mathnet  crossref  isi  scopus

   2020
3. 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  mathnet  crossref  isi  scopus; 4

   2019
4. Goncharov S.S., Sviridenko D.I., “Logical Language of Description of Polynomial Computing”, Doklady Mathematics, 99:2 (2019), 121–124  crossref  zmath  isi  elib  scopus
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  mathnet  crossref  crossref  mathscinet  zmath  isi  scopus

   2018
6. S. S. Goncharov, D. I. Sviridenko, “Recursive terms in semantic programming”, Siberian Math. J., 59:6 (2018), 1014–1023  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus
7. 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  crossref  mathscinet  zmath  isi  scopus

   2017
8. 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  mathnet  crossref  crossref  isi  elib  elib  scopus
9. S. S. Goncharov, “Conditional terms in semantic programming”, Siberian Math. J., 58:5 (2017), 794–800  mathnet  crossref  crossref  isi  elib  elib  scopus

   2015
10. 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  crossref  crossref  mathscinet  zmath  zmath  isi  elib  elib  scopus
11. 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  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus
12. 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  mathnet  crossref  crossref  crossref  mathscinet  zmath  zmath  isi  isi  elib  elib  scopus
13. 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  crossref  zmath  elib
14. 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)  elib
15. 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)  mathscinet  zmath

   2017
16. 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  mathnet  crossref  crossref  elib  elib

   2015
17. 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  mathnet  crossref  crossref  mathscinet  isi  elib  scopus
18. 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  mathnet  crossref  crossref  mathscinet  isi  elib  scopus

   2014
19. S. A. Badaev, S. S. Goncharov, “Generalized computable universal numberings”, Algebra and Logic, 53:5 (2014), 355–364  mathnet  crossref  mathscinet  isi  elib  scopus

   2015
20. S. S. Goncharov, “Index Sets of Almost Prime Constructive Models”, J. Math. Sci., 205:3 (2015), 355–367  mathnet  crossref  elib
21. S. S. Goncharov, M. I. Marchuk, “Index Sets of Autostable Relative to Strong Constructivizations Constructive Models”, J. Math. Sci., 205:3 (2015), 368–388  mathnet  crossref  elib  elib

   2012
22. Goncharov S. S., “Problems of autostability and spectrum of autostability”, The Bulletin of Symbolic Logic, 18:3 (2012), 422-423  mathscinet

   2011
23. 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  mathnet  crossref  mathscinet  isi  elib  elib  scopus
24. 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
25. 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.  elib
26. 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.  zmath  elib
27. Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey, “Inductive inference and computable numberings”, Theoretical Computer Science, 412:18 (2011), 1652-1668 http://www.sciencedirect.com/science/article/pii/S0304397510007425  crossref  mathscinet  zmath  isi  elib  scopus 6

   2010
28. S. S. Goncharov, “On autostability of almost prime models relative to strong constructivizations”, Russian Math. Surveys, 65:5 (2010), 901–935  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  adsnasa  isi  elib  elib  scopus
29. 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.  elib
30. 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  crossref  mathscinet  scopus 4

   2009
31. S. S. Goncharov, “Autostability of prime models under strong constructivizations”, Algebra and Logic, 48:6 (2009), 410–417  mathnet  crossref  mathscinet  zmath  isi  elib  elib  scopus
32. 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  crossref  mathscinet  zmath  elib  scopus 19
33. 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  crossref  mathscinet  zmath  isi  scopus 2

   2008
34. S. A. Badaev, S. S. Goncharov, A. Sorbi, “Some remarks on completion of numberings”, Siberian Math. J., 49:5 (2008), 780–783  mathnet  crossref  mathscinet  isi  elib  elib  scopus
35. S. S. Goncharov, “On two problems of Turing complexity for strongly minimal theories”, Dokl. Math., 77:3 (2008), 438–440  mathnet  crossref  mathscinet  zmath  isi  elib  elib  scopus
36. Goncharov S.S., “ALGORITMIChESKAYa SLOZhNOST SChETNYKh MODELEI SILNO MINIMALNYKh TEORII”, Vestnik Novosibirskogo gosudarstvennogo universiteta. Seriya: Matematika, mekhanika, informatika., 8, 2 (2008) , 6 pp.  elib
37. Goncharov S.S., “ON TWO PROBLEMS OF TURING COMPLEXITY FOR STRONGLY MINIMAL THEORIES”, Doklady Mathematics, 77:3 (2008), 438-440  mathnet  crossref  mathscinet  zmath  isi  elib  scopus
38. 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.  elib
39. 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-34 http://link.springer.com/chapter/10.1007/978-0-387-68546-5_2  zmath
40. Demenkov P.S., Yarkova E.E., Ivanisenko V.A., Goncharov S.S., Kolchanov N.A., “Predskazanie izmeneniya termodinamicheskoi stabilnosti belkov pri odinochnykh aminokislotnykh zamenakh”, Sistemnaya kompyuternaya biologiya, Ros. akad. nauk, Sib. otd-nie, In-t tsitologii i genetiki [i dr.]. -, Integratsionnye proekty SO RAN; vyp. 14, eds. N.A. Kolchanov, S.S. Goncharov, V.A. Likhoshvai, V.A. Ivanisenko, Izd-vo SO RAN, Novosibirsk, 2008, 269-275 http://www.prometeus.nsc.ru/contents/integrpr/014.ssi
41. Ivanisenko V.A., Demenkov P.S., Fomin E.S., Krestyanova M.A., Oshurkov I.S., Ivanisenko T.V., Ivanisenko N.V., Pintus S.S., Yarkova E.E., Stepanenko I.L., Surnina N.Yu., Goncharov S.S., Kolchanov N.A., “Raspoznavanie funktsionalnykh saitov v prostranstvennykh strukturakh belkov”, Sistemnaya kompyuternaya biologiya ; Ros. akad. nauk, Sib. otd-nie, In-t tsitologii i genetiki [i dr.]., Ros. akad. nauk, Sib. otd-nie, In-t tsitologii i genetiki [i dr.]., (Integratsionnye proekty SO RAN; vyp. 14), eds. / otv. red. N.A. Kolchanov, S.S. Goncharov, V.A. Likhoshvai, V.A. Ivanisenko, Izd-vo SO RAN, Novosibirsk, 2008, 231-244 http://www.prometeus.nsc.ru/contents/integrpr/014.ssi
42. 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  mathnet
43. 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  mathnet
44. 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  mathnet

   2007
45. 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  crossref  mathscinet  zmath  isi  elib  scopus 9
46. 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  mathscinet  zmath

   2006
47. 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  mathnet  crossref  mathscinet  zmath  elib  scopus
48. S. S. Goncharov, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., mech. and informatics, 6:3 (2006), 3–4  mathnet
49. 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  mathnet

   2005
50. S. A. Badaev, S. S. Goncharov, A. Sorbi, “Elementary Theories for Rogers Semilattices”, Algebra and Logic, 44:3 (2005), 143–147  mathnet  crossref  mathscinet  zmath  elib  scopus
51. 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  mathnet  crossref  mathscinet  isi  scopus
52. 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.  crossref  mathscinet  zmath  isi  elib  scopus 72

   2004
53. S. S. Goncharov, B. Khoussainov, “Complexity of Categorical Theories with Computable Models”, Algebra and Logic, 43:6 (2004), 365–373  mathnet  crossref  mathscinet  zmath  scopus
54. 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  mathnet  crossref  mathscinet  zmath  zmath  scopus
55. 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  crossref  mathscinet  zmath  isi  elib  scopus 14

   2003
56. S. S. Goncharov, R. Downey, D. Hirschfeldt, “Degree Spectra of Relations on Boolean Algebras”, Algebra and Logic, 42:2 (2003), 105–111  mathnet  crossref  mathscinet  zmath  scopus
57. 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  mathnet  mathscinet  zmath
58. 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  crossref  mathscinet  zmath  isi  elib  scopus 26
59. 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  crossref  mathscinet  zmath  isi  elib  scopus 14
60. Serikzhan Badaev, Sergey Goncharov, Andrea Sorbi, “Completeness and Universality of Arithmetical Numberings”, Computability and Models The University Series in Mathematics, Springer, 2003, 11-44  mathscinet
61. 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  crossref  mathscinet  zmath  isi  scopus 3

   2002
62. S. S. Goncharov, J. F. Knight, “Computable Structure and Non-Structure Theorems”, Algebra and Logic, 41:6 (2002), 351–373  mathnet  crossref  mathscinet  zmath  scopus
63. S. S. Goncharov, S. Lempp, R. Solomon, “Friedberg Numberings of Families of $n$-Computably Enumerable Sets”, Algebra and Logic, 41:2 (2002), 81–86  mathnet  crossref  mathscinet  zmath  scopus
64. Goncharov, SS, “Rigid relations on constructive models”, Doklady Mathematics, 65:3 (2002), 363-364  mathnet  mathscinet  zmath  isi
65. Goncharov, SS; Khusainov, BK, “Complexity of categorical theories with computable models”, Doklady Mathematics, 66:1 (2002) , 52-54 pp.  mathscinet  elib
66. Goncharov, SS; Khusainov, BK, “Complexity of categorical theories with computable models”, Doklady Mathematics, 66:1 (2002) , 5 pp.  mathscinet

   2001
67. S. A. Badaev, S. S. Goncharov, “Rogers Semilattices of Families of Arithmetic Sets”, Algebra and Logic, 40:5 (2001), 283–291  mathnet  crossref  mathscinet  zmath  scopus

   2000
68. 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  mathnet  mathscinet  zmath
69. 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  mathnet  mathscinet

   1999
70. Ershov Yu. L., Goncharov S. S., Konstruktivnye modeli, (Sibirskaya shkola algebry i logiki), Nauchnaya kniga, Novosibirsk, 1999 , 360 pp.  mathscinet
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.  crossref  mathscinet  zmath  isi  scopus 21

   1998
72. 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  crossref  elib  scopus 3
73. 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.  crossref  mathscinet  isi  scopus
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.  scopus
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.  scopus
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  scopus
77. S. S. Goncharov, S. A. Badaev, “Families with one-element Rogers semilattice”, Algebra and Logic, 37:1 (1998), 21–34  mathnet  crossref  mathscinet  mathscinet  zmath  scopus

   1997
78. Goncharov S.S., Khusainov B., “ON THE SPECTRUM OF DEGREES OF DECIDABLE RELATIONS”, Doklady Mathematics, 55:1 (1997) , 7 pp.  mathscinet  zmath  elib
79. 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.  mathscinet  zmath
80. Goncharov, SS; Khusainov, B, “On degrees spectra of decidable relations”, Doklady Akademii Nauk, 352:3 (1997), 301-303  mathnet  mathnet  mathscinet  zmath  isi
81. 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  mathscinet
82. S. S. Goncharov, A. Sorbi, “Generalized computable numerations and nontrivial Rogers semilattices”, Algebra and Logic, 36:6 (1997), 359–369  mathnet  crossref  mathscinet  mathscinet  zmath  scopus

   1996
83. Goncharov S. S., Schetnye bulevy algebry i razreshimost, Sibirskaya shkola algebry i logiki, Nauchnaya kniga, Novosibirsk, 1996 , 373 pp.
84. Badaev, SA; Goncharov, SS; Ershov, YL; et al., “On computable minimal enumerations”, Algebra, 1996 , 21-33 pp.  zmath

   1995
85. S. S. Goncharov, M. Pourmahdian, “Iterated expansions of models for countable theories and their applications”, Algebra and Logic, 34:6 (1995), 346–358  mathnet  crossref  mathscinet  mathscinet  zmath  scopus

   1994
86. S. S. Goncharov, “A unique positive enumeration”, Siberian Adv. Math., 4:1 (1994), 52–64  mathscinet  zmath

   1993
87. S. S. Goncharov, “Computable classes of constructivizations for models of finite computability type”, Siberian Math. J., 34:5 (1993), 812–824  mathnet  crossref  mathscinet  zmath  isi  scopus
88. GONCHAROV, SS, “POSITIVE COMPUTABLE ENUMERATIONS”, Doklady Akademii Nauk, 332:2 (1993) , 2 pp.  mathscinet  zmath
89. Goncharov S. S., “Effectively infinite classes of weak constructivizations of models”, Algebra and Logic Plenum Publ.Corp.,, 32:6 (1993), 342-360  mathnet  crossref  mathscinet  zmath  scopus
90. 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  crossref  mathscinet  zmath  isi  scopus 8
91. S. S. Goncharov, A. Yakhnis, V. Yakhnis, “Effectively infinite classes of enumerations”, Siberian Adv. Math., 3:1 (1993), 94–120  mathscinet  zmath
92. 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  mathnet  crossref  mathscinet  mathscinet  zmath  scopus

   1994
93. S. S. Goncharov, “Positive computable enumerations”, Dokl. Math., 48:2 (1994), 268–270  mathnet  mathscinet  zmath

   1992
94. S. S. Goncharov, “Semeistva s edinstvennoi pozitivnoi numeratsiei”, Vychisl. sistemy, 146 (1992), 96–104  mathscinet

   1991
95. S. S. Goncharov, “Ob odnom sposobe effektivnoi realizatsii programm v semanticheskom programmirovanii”, Vychisl. sistemy, 139 (1991), 117–123  mathscinet

   1989
96. S. S. Goncharov, A. V. Molokov, N. S. Romanovskii, “Nilpotent groups of finite algorithmic dimension”, Siberian Mathematical Journal, 30:1 (1989) , 6 pp.  mathnet  crossref  mathscinet  mathscinet  mathscinet  zmath  isi  scopus

   1991
97. S. S. Goncharov, “The characterization of axiomatizable classes with strong epimorphisms”, Sib. Adv. Math., 1:2 (1991), 57–76  mathscinet  mathscinet  zmath  zmath

   1989
98. S. S. Goncharov, B. N. Drobotun, “Algorithmic dimension of nilpotent groups”, Siberian Math. J., 30:2 (1989), 210–217  mathnet  crossref  mathscinet  mathscinet  mathscinet  zmath  zmath  isi  scopus
99. S. S. Goncharov, D. I. Sviridenko, “Logicheskoe programmirovanie v shirokom smysle”, Vychisl. sistemy, 129 (1989), 3–48  mathscinet  zmath
100. S. S. Goncharov, “Characterization of axiomatizable classes with strong epimorphisms”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 12 (1989), 24–39  mathnet  mathscinet  zmath

   1988
101. S. S. Goncharov, “Semeistvo s edinstvennoi odnoznachnoi, no ne naimenshei numeratsiei”, Tr. In-ta matematiki SO AN SSSR, 8 (1988), 42–58  mathscinet  zmath
102. S. S. Goncharov, “A family with a unique univalent but not least numeration”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 8 (1988), 42–58  mathnet  mathscinet  zmath

   1987
103. Yu. L. Ershov, S. S. Goncharov, D. I. Sviridenko, “Semantic foundations of programming”, Lecture Notes in Computer Science, 278 (1987), 116-122  crossref  zmath  isi  scopus 8
104. S. S. Goncharov, “Axiomatizable classes with strong homomorphisms”, Studia Logica, 46:2 (1987), 113–120  crossref  mathscinet  zmath  scopus
105. S. S. Goncharov, V. D. Dzgoev, “Pozitivnye modeli i abstraktnye tipy dannykh”, Vychisl. sistemy, 122 (1987), 47–58  mathscinet  zmath
106. S. S. Goncharov, D. I. Sviridenko, “$\Sigma^{+}$-programmy i ikh semantiki”, Vychisl. sistemy, 120 (1987), 24–51  mathscinet  zmath

   1986
107. S. S. Goncharov, D. I. Sviridenko, “Theoretical aspects of $\Sigma$-programming”, Lecture Notes in Computer Science, 215 (1986) , 10 pp.  mathscinet  zmath  isi
108. S. S. Goncharov, D. I. Sviridenko, “Mathematical principles of semantic programming”, Doklady Akademii Nauk SSSR, 289:6 (1986), 1324-1328  mathnet  mathnet  mathscinet  zmath  isi
109. S. S. Goncharov, “Teoriya spiskov i ee modeli”, Vychisl. sistemy, 114 (1986), 84–95  mathscinet  zmath
110. S. S. Goncharov, “Zamechanie ob aksiomakh spisochnoi nadstroiki GES”, Vychisl. sistemy, 114 (1986), 11–15  mathscinet  zmath
111. S. S. Goncharov, “Ob aksiomakh dlya klassov s silnymi gomomorfizmami”, Vychisl. sistemy, 116 (1986), 140–155  mathscinet  zmath

   1985
112. C. J. Ash, S. S. Goncharov, “Strong $\Delta^0_2$-categoricity”, Algebra and Logic, 24:6 (1985), 471–476  mathnet  crossref  mathscinet  mathscinet  zmath  scopus
113. 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  mathscinet  zmath
114. 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  mathscinet  zmath

   1989
115. S. S. Goncharov, “Data models and languages for their description”, Am. Math. Soc. Translations – Series 2, 143 (1989), 139–152  crossref  mathscinet  zmath  zmath
116. S. S. Goncharov, D. I. Sviridenko, “$\Sigma$-programming”, Am. Math. Soc. Translations – Series 2, 142 (1989), 101–121  crossref  mathscinet  zmath  zmath

   1984
117. S. S. Goncharov, A. A. Novikov, “Examples of nonautostable systems”, Siberian Math. J., 25:4 (1984), 538–545  mathnet  crossref  mathscinet  mathscinet  zmath  isi  isi  scopus

   1983
118. S. S. Goncharov, “Universal recursively enumerable Boolean algebras”, Siberian Math. J., 24:6 (1983), 852–858  mathnet  crossref  mathscinet  mathscinet  zmath  isi  isi  scopus
119. S. S. Goncharov, “Positive numerations of families with one-valued numerations”, Algebra and Logic, 22:5 (1983), 345–350  mathnet  crossref  mathscinet  mathscinet  zmath  scopus

   1982
120. S. S. Goncharov, “Predelno ekvivalentnye konstruktivizatsii”, Tr. In-ta matematiki SO AN SSSR, 2, Institut matematiki SO AN SSSR, 1982, 4–12  mathscinet  zmath
121. S. S. Goncharov, “Limit equivalent constructivizations”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 2 (1982), 4–12  mathnet  mathscinet  zmath

   1981
122. S. S. Goncharov, “Groups with a finite number of constructivizations”, Soviet Math. Dokl., 23:2 (1981) , 4 pp.  mathscinet  zmath  isi
123. S. S. Goncharov, “Groups with a finite number of constructivizations”, Dokl. Akad. Nauk SSSR, 256:2 (1981), 269–272  mathnet  mathscinet  zmath

   1980
124. S. S. Goncharov, “Totally transcendental theory with a nonconstructivizable prime model”, Siberian Math. J., 21:1 (1980), 32–37  mathnet  crossref  mathscinet  zmath  isi  isi  scopus
125. S. S. Goncharov, “The problem of the number of nonautoequivalent constructivizations”, Soviet. Math. Dokl., 21 (1980) , 411-414 pp.  mathscinet  mathscinet  zmath  isi
126. S. S. Goncharov, B. N. Drobotun, “Numerations of saturated and homogeneous models”, Siberian Math. J., 21:2 (1980), 164–176  mathnet  crossref  mathscinet  mathscinet  mathscinet  zmath  zmath  isi  scopus
127. S. S. Goncharov, “Autostability of models and Abelian groups”, Algebra and Logic, 19:1 (1980), 13–27  mathnet  crossref  mathscinet  mathscinet  zmath  scopus
128. S. S. Goncharov, V. D. Dzgoev, “Autostability of models”, Algebra and Logic, 19:1 (1980), 28–37  mathnet  crossref  mathscinet  mathscinet  zmath  scopus
129. S. S. Goncharov, “A totally transcendental decidable theory without constructivizable homogeneous models”, Algebra and Logic, 19:2 (1980), 85–93  mathnet  crossref  mathscinet  mathscinet  scopus
130. S. S. Goncharov, “Computable single-valued numerations”, Algebra and Logic, 19:5 (1980), 325–356  mathnet  crossref  mathscinet  mathscinet  zmath  scopus
131. S. S. Goncharov, “Problem of the number of non-self-equivalent constructivizations”, Algebra and Logic, 19:6 (1980), 401–414  mathnet  crossref  mathscinet  mathscinet  zmath  scopus
132. S. S. Goncharov, “The problem of the number of nonautoequivalent constructivizations”, Dokl. Akad. Nauk SSSR, 251:2 (1980), 271–274  mathnet  mathscinet  zmath

   1978
133. S. S. Goncharov, “Constructive models of $\aleph_1$-categorical theories”, Math. Notes, 23:6 (1978), 486–487  mathnet  crossref  mathscinet  zmath  scopus
134. S. S. Goncharov, “Strong constructivizability of homogeneous models”, Algebra and Logic, 17:4 (1978), 247–263  mathnet  crossref  mathscinet  mathscinet  zmath  scopus

   1977
135. S. S. Goncharov, “The quantity of nonautoequivalent constructivizations”, Algebra and Logic, 16:3 (1977), 169–185  mathnet  crossref  mathscinet  mathscinet  zmath  scopus

   1976
136. S. S. Goncharov, “Non-self-equivalent constructivization of atomic Boolean algebras”, Math. Notes, 19:6 (1976), 500–503  mathnet  crossref  mathscinet  zmath  scopus
137. S. S. Goncharov, “Restricted theories of constructive Boolean algebras”, Siberian Math. J., 17:4 (1976), 601–611  mathnet  crossref  mathscinet  mathscinet  mathscinet  zmath  isi  scopus

   1975
138. S. S. Goncharov, “Autostability and computable families of constructivizations”, Algebra and Logic, 14:6 (1975), 392–409  mathnet  crossref  mathscinet  mathscinet  mathscinet  zmath  scopus
139. S. S. Goncharov, “Some properties of the constructivization of Boolean algebras”, Siberian Math. J., 16:2 (1975), 203–214  mathnet  crossref  mathscinet  mathscinet  mathscinet  zmath  zmath  isi  scopus

   1974
140. S. S. Goncharov, Konstruktivnye bulevy algebry, dissertatsiya kandidata fiziko-matematicheskikh nauk, Izdatelstvo Instituta matematiki SO AN SSSR, Novosibirsk, 1974 , 121 pp.
141. S. S. Goncharov, “Constructivizability of superatomic Boolean algebras”, Algebra and Logic, 12:1 (1974) , 6 pp.  crossref  mathscinet  mathscinet  scopus
142. S. S. Goncharov, A. T. Nurtazin, “Constructive models of complete solvable theories”, Algebra and Logic, 12:2 (1974) , 11 pp.  crossref  mathscinet  mathscinet  scopus

   1973
143. S. S. Goncharov, A. T. Nurtazin, Algebra Logika, 12:2 (1973), 125–142  mathnet  mathscinet
144. S. S. Goncharov, Algebra Logika, 12:1 (1973), 31–40  mathnet  mathscinet

Presentations in Math-Net.Ru
1. Логических подход к проблемам управления и ИИ в рамках семантического моделирования
S. S. Goncharov
Second Conference of Russian Mathematical Centers. Section «Mathematical Logic and Theoretical Computer Science»
November 8, 2022 17:30   
2. The computability via definability in semantic modeling
Sergei S. Goncharov
Logical Perspectives 2018
May 17, 2018 11:30   
3. Decidability, complexity and index sets of classes of computable models
S. S. Goncharov
Mathematical Logic, Algebra and Computation: A two-day conference dedicated to 85-th anniversary of S. I. Adian
July 18, 2016 12:10   
4. Математические исследования в Институте математики им. С. Л. Соболева СО РАН и взаимодействие с институтами и университетами Сибири
S. S. Goncharov
General Meeting of the Branch of Mathematical Sciences, RAS, 2015
March 21, 2016 14:30   
5. Открытие конференции
S. S. Goncharov
Междкнародная конференция, посвященная 90-летию со дня рождения Г. И. Марчука "Современные проблемы вычислительной математики и математического моделирования"
June 8, 2015 15:00   

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024