Theoretical aspects of Sigma-programming. - Sergei S. Goncharov; Dmitri Ivanovich Sviridenko (Mathematical Methods of Specification and Synthesis of Software Systems, 1985)

Semantic Programming. - Sergei S. Goncharov; Yuri Leonidovich Ershov; Dmitri Ivanovich Sviridenko (IFIP Congress, 1986)

Semantic Foundations of Programming. - Yuri Leonidovich Ershov; Sergei S. Goncharov; Dmitri Ivanovich Sviridenko (FCT, 1987)

Axiomatizable classes with strong homomorphisms. - Sergei S. Goncharov (Stud Logica, 1987)

Some Effectively Infinite Classes of Enumerations. - Sergei S. Goncharov; Alexander Yakhnis; Vladimir Yakhnis (Ann. Pure Appl. Log., 1993)

Classes with Pairwise Equivalent Enumerations. - Sergei S. Goncharov; Serikzhan A. Badaev (LFCS, 1994)

Decidable Boolean Algebras of Low Level. - Sergei S. Goncharov (Ann. Pure Appl. Log., 1998)

Computably Categorical Structures and Expansions by Constants. - Peter Cholak; Sergei S. Goncharov; Bakhadyr Khoussainov; Richard A. Shore (J. Symb. Log., 1999)

Computability and models - perspectives east and west. - S. Barry Cooper; Sergey S. Goncharov (Springer, 2003)

Simple and immune relations on countable structures. - Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy (Arch. Math. Log., 2003)

Pi11 relations and paths through. - Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Richard A. Shore (J. Symb. Log., 2004)

Enumerations in computable structure theory. - Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy; Russell G. Miller; Reed Solomon (Ann. Pure Appl. Log., 2005)

Index sets for classes of high rank structures. - Wesley Calvert; Ekaterina B. Fokina; Sergei S. Goncharov; Julia F. Knight; Oleg V. Kudinov; Andrei S. Morozov; Vadim Puzarenko (J. Symb. Log., 2007)

On a Question of Frank Stephan. - Klaus Ambos-Spies; Serikzhan A. Badaev; Sergey Goncharov 002 (TAMC, 2008)

Categoricity of computable infinitary theories. - Wesley Calvert; Sergei S. Goncharov; Julia F. Knight; Jessica Millar (Arch. Math. Log., 2009)

Intrinsic bounds on complexity and definability at limit levels. - John Chisholm; Ekaterina B. Fokina; Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Sara Quinn (J. Symb. Log., 2009)

Decidability and Computability of Certain Torsion-Free Abelian Groups. - Rodney G. Downey; Sergei S. Goncharov; Asher M. Kach; Julia F. Knight; Oleg V. Kudinov; Alexander G. Melnikov; Daniel Turetsky (Notre Dame J. Formal Log., 2010)

Inductive inference and computable numberings. - Klaus Ambos-Spies; Serikzhan A. Badaev; Sergey S. Goncharov (Theor. Comput. Sci., 2011)

Hanf number for Scott sentences of computable structures. - Sergey Goncharov 002; Julia F. Knight; Ioannis A. Souldatos (Arch. Math. Log., 2018)

The Expressiveness of Looping Terms in the Semantic Programming. - Sergey Goncharov 002; Sergey Ospichev; Denis K. Ponomaryov; Dmitri Ivanovich Sviridenko (CoRR, 2019)

Decompositions of decidable abelian groups. - Nikolay Bazhenov 001; Sergey Goncharov 002; Alexander G. Melnikov (Int. J. Algebra Comput., 2020)

Task-driven approach to artificial intelligence. - E. E. Vityaev 001; Sergey S. Goncharov; Dmitri Ivanovich Sviridenko (Cogn. Syst. Res., 2023)

A non-computable c.e. closed subset of [0,1]. - Serikzhan A. Badaev; Nikolay Bazhenov 001; Sergey Goncharov 002; Birzhan S. Kalmurzayev; Alexander G. Melnikov (J. Log. Comput., 2025)