| 2010 | ||
|---|---|---|
| j10 | 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 Journal of Formal Logic 51(1): 85-96 (2010) | |
| 2009 | ||
| j9 | Wesley Calvert, Sergei S. Goncharov, Julia F. Knight, Jessica Millar: Categoricity of computable infinitary theories. Arch. Math. Log. 48(1): 25-38 (2009) | |
| j8 | 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 | ||
| j7 | Wesley Calvert, Ekaterina B. Fokina, Sergei S. Goncharov, Julia F. Knight, Oleg V. Kudinov, Andrei S. Morozov, V. Puzarenko: Index sets for classes of high rank structures. J. Symb. Log. 72(4): 1418-1432 (2007) | |
| 2005 | ||
| j6 | Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell Miller, Reed Solomon: Enumerations in computable structure theory. Ann. Pure Appl. Logic 136(3): 219-246 (2005) | |
| 2004 | ||
| j5 | 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 | ||
| j4 | 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 | ||
| j3 | 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 | ||
| j2 | Sergei S. Goncharov: Decidable Boolean Algebras of Low Level. Ann. Pure Appl. Logic 94(1-3): 75-95 (1998) | |
| 1994 | ||
| c4 | Sergei S. Goncharov, S. A. Badaev: Classes with Pairwise Equivalent Enumerations. LFCS 1994: 140-141 | |
| 1993 | ||
| j1 | Sergei S. Goncharov, Alexander Yakhnis, Vladimir Yakhnis: Some Effectively Infinite Classes of Enumerations. Ann. Pure Appl. Logic 60(3): 207-235 (1993) | |
| 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 | |
Colors in the list of coauthors
Last update Fri May 24 19:48:34 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page