Ivan N. Soskov

According to our database, Ivan N. Soskov authored at least 19 papers between 1989 and 2013.

Collaborative distances:

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

2013

Quasi-minimal degrees for degree spectra.

Alexandra A. Soskova, Ivan N. Soskov

J. Log. Comput., 2013

Effective properties of Marker's extensions.

Ivan N. Soskov

J. Log. Comput., 2013

Computability in Europe 2011.

Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov

Ann. Pure Appl. Log., 2013

A Note on ω-Jump Inversion of Degree Spectra of Structures.

Ivan N. Soskov

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Embedding countable partial orderings in the enumeration degrees and the <i>ω</i>-enumeration degrees.

Mariya Ivanova Soskova, Ivan N. Soskov

J. Log. Comput., 2012

2011

Kalimullin Pairs of §02 w-Enumeration Degrees.

Ivan N. Soskov, Mariya Ivanova Soskova

Int. J. Softw. Informatics, 2011

Preface.

Joan Bagaria, Yiannis N. Moschovakis, Margarita Otero, Ivan N. Soskov

Ann. Pure Appl. Log., 2011

2009

A Jump Inversion Theorem for the Degree Spectra.

Alexandra A. Soskova, Ivan N. Soskov

J. Log. Comput., 2009

The jump operator on the omega-enumeration degrees.

Hristo Ganchev, Ivan N. Soskov

Ann. Pure Appl. Log., 2009

2007

The omega-Enumeration Degrees.

Ivan N. Soskov

J. Log. Comput., 2007

2006

Uniform regular enumerations.

Ivan N. Soskov, Bogomil Kovachev

Math. Struct. Comput. Sci., 2006

2005

Uniform Operators.

Ivan N. Soskov

Proceedings of the New Computational Paradigms, 2005

2002

Regular Enumerations.

Ivan N. Soskov, V. Baleva

J. Symb. Log., 2002

2000

A jump inversion theorem for the enumeration jump.

Ivan N. Soskov

Arch. Math. Log., 2000

1996

Intrinsically Hyperarithmetical Sets.

Ivan N. Soskov

Math. Log. Q., 1996

Intrinsically II₁¹ Relations.

Ivan N. Soskov

Math. Log. Q., 1996

1991

Second Order Definability Via enumerations.

Ivan N. Soskov

Math. Log. Q., 1991

1990

Computability by means of effectively definable schemes and definability via enumerations.

Ivan N. Soskov

Arch. Math. Log., 1990

1989

Definability Via Enumerations.

Ivan N. Soskov

J. Symb. Log., 1989