Ivan N. Soskov - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2013

Computability in Europe 2011Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov. APAL, 164(5):509-510, 2013. [doi]

Effective properties of Marker's extensionsIvan N. Soskov. logcom, 23(6):1335-1367, 2013. [doi]

A Note on ω-Jump Inversion of Degree Spectra of StructuresIvan N. Soskov. CiE 2013: 365-370 [doi]

Quasi-minimal degrees for degree spectraAlexandra A. Soskova, Ivan N. Soskov. logcom, 23(6):1319-1334, 2013. [doi]

2012

ω-enumeration degreesMariya Ivanova Soskova, Ivan N. Soskov. logcom, 22(4):927-952, 2012. [doi]

2011

Kalimullin Pairs of §02 w-Enumeration DegreesIvan N. Soskov, Mariya Ivanova Soskova. ijsi, 5(4):637-658, 2011. [doi]

2009

The jump operator on the omega-enumeration degreesHristo Ganchev, Ivan N. Soskov. APAL, 160(3):289-301, 2009. [doi]

A Jump Inversion Theorem for the Degree SpectraAlexandra A. Soskova, Ivan N. Soskov. logcom, 19(1):199-215, 2009. [doi]

2007

The omega-Enumeration DegreesIvan N. Soskov. logcom, 17(6):1193-1214, 2007. [doi]

2006

Uniform regular enumerationsIvan N. Soskov, Bogomil Kovachev. mscs, 16(5):901-924, 2006. [doi]

2005

Uniform OperatorsIvan N. Soskov. cie 2005: 441-450 [doi]

2002

Regular EnumerationsIvan N. Soskov, V. Baleva. JSYML, 67(4):1323-1343, 2002.

2000

A jump inversion theorem for the enumeration jumpIvan N. Soskov. AML, 39(6):417-437, 2000. [doi]

1996

Intrinsically Hyperarithmetical SetsIvan N. Soskov. mlq, 42:469-480, 1996.

Intrinsically II::1:::::1::: RelationsIvan N. Soskov. mlq, 42:109-126, 1996.

1991

Second Order Definability Via enumerationsIvan N. Soskov. mlq, 37(2-4):45-54, 1991. [doi]

1990

Computability by means of effectively definable schemes and definability via enumerationsIvan N. Soskov. AML, 29(3):187-200, 1990. [doi]

1989

Definability Via EnumerationsIvan N. Soskov. JSYML, 54(2):428-440, 1989.

Sign in or sign up to see more results.

runs on WebDSL