Mariya Ivanova Soskova

43 papers C 9Journal 30Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
On quasi-reducibility for c.e. sets Part I. The structure of the
J. Log. Comput.
Sapir Ben-Shahar, Rodney G. Downey, Mariya Ivanova Soskova
2026 J jnl
Redundancy of information: Lowering effective dimension.
J. Comput. Syst. Sci.
Jun Le Goh, Joseph S. Miller, Mariya Ivanova Soskova, Linda Westrick
2023 J jnl
Expanding the Reals by continuous Functions Adds no Computational Power.
J. Symb. Log.
Uri Andrews, Julia F. Knight, Rutger Kuyper, Joseph S. Miller, Mariya Ivanova Soskova
2023 J jnl
Maximal Towers and Ultrafilter Bases in Computability Theory.
J. Symb. Log.
Steffen Lempp, Joseph S. Miller, André Nies, Mariya Ivanova Soskova
2023 J jnl
Minimal covers in the Weihrauch degrees.
CoRR
Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti
2023 J jnl
Pa Relative to an Enumeration Oracle.
J. Symb. Log.
Jun Le Goh, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova
2023 C conf
The Relationship Between Local and Global Structure in the Enumeration Degrees.
CiE
Mariya Ivanova Soskova
2022 J jnl
A Structural Dichotomy in the Enumeration Degrees.
J. Symb. Log.
Hristo Aleksndrov Ganchev, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova
2022 J jnl
Extensions of two constructions of Ahmad.
Comput.
Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya Ivanova Soskova
2022 J jnl
Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021.
Comput.
Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova
2021 J jnl
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461).
Dagstuhl Reports
Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova
2018 J jnl
Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138].
Ann. Pure Appl. Log.
Joseph S. Miller, Mariya Ivanova Soskova
2018 J jnl
Enumeration 1-Genericity in the Local Enumeration Degrees.
Notre Dame J. Formal Log.
Liliana Badillo, Charles M. Harris, Mariya Ivanova Soskova
2018 J jnl
S. Barry Cooper (1943-2015).
Comput.
Richard Elwes, Andy Lewis-Pye, Benedikt Löwe, Dugald Macpherson, Dag Normann, Andrea Sorbi, Alexandra A. Soskova, Mariya Ivanova Soskova, Peter van Emde Boas, Stanley S. Wainer
2018 J jnl
The jump hierarchy in the enumeration degrees.
Comput.
Hristo Aleksndrov Ganchev, Mariya Ivanova Soskova
2017 — conf
Enumeration Reducibility and Computable Structure Theory.
Computability and Complexity
Alexandra A. Soskova, Mariya Ivanova Soskova
2017 — ch.
Introduction.
The Incomputable
Mariya Ivanova Soskova
2017 — conf
Nondensity of Double Bubbles in the D.C.E. Degrees.
Computability and Complexity
Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev
2017 — book
The Incomputable: Journeys Beyond the Turing Barrier
The Incomputable
S. Barry Cooper, Mariya Ivanova Soskova
2016 J jnl
On Kalimullin pairs.
Comput.
Mingzhong Cai, Steffen Lempp, Joseph S. Miller, Mariya Ivanova Soskova
2016 J jnl
The automorphism group of the enumeration degrees.
Ann. Pure Appl. Log.
Mariya Ivanova Soskova
2015 C ed.
Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings
CiE
Arnold Beckmann, Victor Mitrana, Mariya Ivanova Soskova
2013 C conf
The Turing Universe in the Context of Enumeration Reducibility.
CiE
Mariya Ivanova Soskova
2013 J jnl
The incomputable.
J. Log. Comput.
S. Barry Cooper, Mariya Ivanova Soskova
2012 J jnl
Cupping and definability in the local structure of the enumeration degrees.
J. Symb. Log.
Hristo Ganchev, Mariya Ivanova Soskova
2012 J jnl
Embedding countable partial orderings in the enumeration degrees and the
J. Log. Comput.
Mariya Ivanova Soskova, Ivan N. Soskov
2012 J jnl
Embedding distributive lattices in the Σ
J. Log. Comput.
Hristo Ganchev, Mariya Ivanova Soskova
2012 J jnl
Interpreting true arithmetic in the local structure of the enumeration degrees.
J. Symb. Log.
Hristo Ganchev, Mariya Ivanova Soskova
2012 J jnl
The high/low hierarchy in the local structure of the omega-enumeration degrees.
Ann. Pure Appl. Log.
Hristo Ganchev, Mariya Ivanova Soskova
2011 J jnl
Kalimullin Pairs of §02 w-Enumeration Degrees.
Int. J. Softw. Informatics
Ivan N. Soskov, Mariya Ivanova Soskova
2011 J jnl
Splitting and nonsplitting in the Σ
Theor. Comput. Sci.
Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova
2010 J jnl
The limitations of cupping in the local structure of the enumeration degrees.
Arch. Math. Log.
Mariya Ivanova Soskova
2009 J jnl
A non-splitting theorem in the enumeration degrees.
Ann. Pure Appl. Log.
Mariya Ivanova Soskova
2009 J jnl
Cupping Delta
Math. Struct. Comput. Sci.
Mariya Ivanova Soskova, Guohua Wu
2008 C conf
Cupping Classes of Enumeration Degrees.
CiE
Mariya Ivanova Soskova
2008 J jnl
How enumeration reducibility yields extended Harrington non-splitting.
J. Symb. Log.
S. Barry Cooper, Mariya Ivanova Soskova
2008 J jnl
Randomness, lowness and degrees.
J. Symb. Log.
George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
2008 C conf
Total Degrees and Nonsplitting Properties of Enumeration Degrees.
TAMC
Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova
2007 C conf
Cupping D
CiE
Mariya Ivanova Soskova, Guohua Wu
2007 J jnl
Genericity and Non-bounding in the Enumeration degrees.
J. Log. Comput.
Mariya Ivanova Soskova
2007 C conf
The Strongest Nonsplitting Theorem.
TAMC
Mariya Ivanova Soskova, S. Barry Cooper
2007 C conf
Working with the
TAMC
George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
2006 C conf
A Generic Set That Does Not Bound a Minimal Pair.
TAMC
Mariya Ivanova Soskova