default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Goncharov 0002
Person information
- affiliation: Sobolev Institute of Mathematics of Siberian Branch of the RAS, Novosibirsk, Russia
Other persons with the same name
- Sergey Goncharov 0001
![[0000-0001-6924-8766]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-6924-8766")
— University of Erlangen-Nuremberg, Department of Computer Science (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2003
[b1]S. Barry Cooper, Sergey S. Goncharov:
Computability and models - perspectives east and west. The University series in mathematics, Springer 2003, ISBN 978-0-306-47400-2, pp. I-XVIII, 1-375
Journal Articles
- 2023
- [j15]E. E. Vityaev, Sergey S. Goncharov, Dmitri Ivanovich Sviridenko:
Task-driven approach to artificial intelligence. Cogn. Syst. Res. 81: 50-56 (2023) - 2020
- [j14]Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov:
Decompositions of decidable abelian groups. Int. J. Algebra Comput. 30(1): 49-90 (2020) - 2018
- [j13]Sergey Goncharov, Julia F. Knight, Ioannis A. Souldatos:
Hanf number for Scott sentences of computable structures. Arch. Math. Log. 57(7-8): 889-907 (2018) - 2011
- [j12]Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov:
Inductive inference and computable numberings. Theor. Comput. Sci. 412(18): 1652-1668 (2011) - 2010
- [j11]Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky:
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. 51(1): 85-96 (2010) - 2009
- [j10]Wesley Calvert, Sergei S. Goncharov, Julia F. Knight, Jessica Millar:
Categoricity of computable infinitary theories. Arch. Math. Log. 48(1): 25-38 (2009) - [j9]John Chisholm, Ekaterina B. Fokina, Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Sara Quinn:
Intrinsic bounds on complexity and definability at limit levels. J. Symb. Log. 74(3): 1047-1060 (2009) - 2007
- [j8]Wesley Calvert, Ekaterina B. Fokina, Sergei S. Goncharov, Julia F. Knight, Oleg V. Kudinov, Andrei S. Morozov, Vadim Puzarenko:
Index sets for classes of high rank structures. J. Symb. Log. 72(4): 1418-1432 (2007) - 2005
- [j7]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell G. Miller, Reed Solomon:
Enumerations in computable structure theory. Ann. Pure Appl. Log. 136(3): 219-246 (2005) - 2004
- [j6]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Richard A. Shore:
Pi11 relations and paths through. J. Symb. Log. 69(2): 585-611 (2004) - 2003
- [j5]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy:
Simple and immune relations on countable structures. Arch. Math. Log. 42(3): 279-291 (2003) - 1999
- [j4]Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore:
Computably Categorical Structures and Expansions by Constants. J. Symb. Log. 64(1): 13-37 (1999) - 1998
- [j3]Sergei S. Goncharov:
Decidable Boolean Algebras of Low Level. Ann. Pure Appl. Log. 94(1-3): 75-95 (1998) - 1993
- [j2]Sergei S. Goncharov, Alexander Yakhnis, Vladimir Yakhnis:
Some Effectively Infinite Classes of Enumerations. Ann. Pure Appl. Log. 60(3): 207-235 (1993) - 1987
- [j1]Sergei S. Goncharov:
Axiomatizable classes with strong homomorphisms. Stud Logica 46(2): 113-120 (1987)
Conference and Workshop Papers
- 2008
- [c5]Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov:
On a Question of Frank Stephan. TAMC 2008: 423-432 - 1994
- [c4]Sergei S. Goncharov, Serikzhan A. Badaev:
Classes with Pairwise Equivalent Enumerations. LFCS 1994: 140-141 - 1987
- [c3]Yuri Leonidovich Ershov, Sergei S. Goncharov, Dmitri Ivanovich Sviridenko:
Semantic Foundations of Programming. FCT 1987: 116-122 - 1986
- [c2]Sergei S. Goncharov, Yuri Leonidovich Ershov, Dmitri Ivanovich Sviridenko:
Semantic Programming. IFIP Congress 1986: 1113-1120 - 1985
- [c1]Sergei S. Goncharov, Dmitri Ivanovich Sviridenko:
Theoretical aspects of Sigma-programming. Mathematical Methods of Specification and Synthesis of Software Systems 1985: 169-179
Informal and Other Publications
- 2019
- [i1]Sergey Goncharov, Sergey Ospichev, Denis K. Ponomaryov, Dmitri Ivanovich Sviridenko:
The Expressiveness of Looping Terms in the Semantic Programming. CoRR abs/1912.02731 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
