Sergey Goncharov

According to our database, Sergey Goncharov authored at least 22 papers between 1985 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Task-driven approach to artificial intelligence.

E. E. Vityaev, Sergey S. Goncharov, Dmitri Ivanovich Sviridenko

Cogn. Syst. Res., September, 2023

2020

Decompositions of decidable abelian groups.

Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov

Int. J. Algebra Comput., 2020

2019

The Expressiveness of Looping Terms in the Semantic Programming.

Sergey Goncharov, Sergey Ospichev, Denis K. Ponomaryov, Dmitri Ivanovich Sviridenko

CoRR, 2019

2018

Hanf number for Scott sentences of computable structures.

Sergey Goncharov, Julia F. Knight, Ioannis A. Souldatos

Arch. Math. Log., 2018

2011

Inductive inference and computable numberings.

Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov

Theor. Comput. Sci., 2011

2010

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

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

Categoricity of computable infinitary theories.

Wesley Calvert, Sergei S. Goncharov, Julia F. Knight, Jessica Millar

Arch. Math. Log., 2009

2008

On a Question of Frank Stephan.

Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov

Proceedings of the Theory and Applications of Models of Computation, 2008

2007

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

2005

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

2004

Pi₁¹ relations and paths through.

Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Richard A. Shore

J. Symb. Log., 2004

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

Computability and models - perspectives east and west.

S. Barry Cooper, Sergey S. Goncharov

The University series in mathematics, Springer, ISBN: 978-0-306-47400-2, 2003

1999

Computably Categorical Structures and Expansions by Constants.

Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore

J. Symb. Log., 1999

1998

Decidable Boolean Algebras of Low Level.

Sergei S. Goncharov

Ann. Pure Appl. Log., 1998

1994

Classes with Pairwise Equivalent Enumerations.

Sergei S. Goncharov, Serikzhan A. Badaev

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993

Some Effectively Infinite Classes of Enumerations.

Sergei S. Goncharov, Alexander Yakhnis, Vladimir Yakhnis

Ann. Pure Appl. Log., 1993

1987

Axiomatizable classes with strong homomorphisms.

Sergei S. Goncharov

Stud Logica, 1987

Semantic Foundations of Programming.

Yuri Leonidovich Ershov, Sergei S. Goncharov, Dmitri Ivanovich Sviridenko

Proceedings of the Fundamentals of Computation Theory, 1987

1986

Semantic Programming.

Sergei S. Goncharov, Yuri Leonidovich Ershov, Dmitri Ivanovich Sviridenko

Proceedings of the Information Processing 86, 1986

1985

Theoretical aspects of Sigma-programming.

Sergei S. Goncharov, Dmitri Ivanovich Sviridenko

Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985