Definability Via Enumerations. - Ivan N. Soskov (J. Symb. Log., 1989)

Computability by means of effectively definable schemes and definability via enumerations. - Ivan N. Soskov (Arch. Math. Log., 1990)

Second Order Definability Via enumerations. - Ivan N. Soskov (Math. Log. Q., 1991)

Intrinsically II11 Relations. - Ivan N. Soskov (Math. Log. Q., 1996)

Intrinsically Hyperarithmetical Sets. - Ivan N. Soskov (Math. Log. Q., 1996)

A jump inversion theorem for the enumeration jump. - Ivan N. Soskov (Arch. Math. Log., 2000)

Regular Enumerations. - Ivan N. Soskov; V. Baleva (J. Symb. Log., 2002)

Uniform Operators. - Ivan N. Soskov (CiE, 2005)

Uniform regular enumerations. - Ivan N. Soskov; Bogomil Kovachev (Math. Struct. Comput. Sci., 2006)

The omega-Enumeration Degrees. - Ivan N. Soskov (J. Log. Comput., 2007)

The jump operator on the omega-enumeration degrees. - Hristo Ganchev; Ivan N. Soskov (Ann. Pure Appl. Log., 2009)

A Jump Inversion Theorem for the Degree Spectra. - Alexandra A. Soskova; Ivan N. Soskov (J. Log. Comput., 2009)

Preface. - Joan Bagaria; Yiannis N. Moschovakis; Margarita Otero; Ivan N. Soskov (Ann. Pure Appl. Log., 2011)

Kalimullin Pairs of §02 w-Enumeration Degrees. - Ivan N. Soskov; Mariya Ivanova Soskova (Int. J. Softw. Informatics, 2011)

Embedding countable partial orderings in the enumeration degrees and the ω-enumeration degrees. - Mariya Ivanova Soskova; Ivan N. Soskov (J. Log. Comput., 2012)

A Note on ω-Jump Inversion of Degree Spectra of Structures. - Ivan N. Soskov (CiE, 2013)

Computability in Europe 2011. - Sam Buss; Benedikt Löwe; Dag Normann; Ivan N. Soskov (Ann. Pure Appl. Log., 2013)

Effective properties of Marker's extensions. - Ivan N. Soskov (J. Log. Comput., 2013)

Quasi-minimal degrees for degree spectra. - Alexandra A. Soskova; Ivan N. Soskov (J. Log. Comput., 2013)