Mariya Ivanova Soskova

Affiliations:
  • Sofia University, Faculty of Mathematics and Informatics, Bulgaria


According to our database1, Mariya Ivanova Soskova authored at least 32 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A Structural Dichotomy in the Enumeration Degrees.
J. Symb. Log., 2022

2021
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461).
Dagstuhl Reports, 2021

2018
Enumeration 1-Genericity in the Local Enumeration Degrees.
Notre Dame J. Formal Log., 2018

The jump hierarchy in the enumeration degrees.
Comput., 2018

S. Barry Cooper (1943-2015).
Comput., 2018

Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138].
Ann. Pure Appl. Log., 2018

2017
Enumeration Reducibility and Computable Structure Theory.
Proceedings of the Computability and Complexity, 2017

Nondensity of Double Bubbles in the D.C.E. Degrees.
Proceedings of the Computability and Complexity, 2017

Introduction.
Proceedings of the Incomputable: Journeys Beyond the Turing Barrier, 2017

2016
On Kalimullin pairs.
Comput., 2016

The automorphism group of the enumeration degrees.
Ann. Pure Appl. Log., 2016

2013
The incomputable.
J. Log. Comput., 2013

The Turing Universe in the Context of Enumeration Reducibility.
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.
J. Log. Comput., 2012

Embedding distributive lattices in the Σ<sup>0</sup><sub>2</sub> enumeration degrees.
J. Log. Comput., 2012

Interpreting true arithmetic in the local structure of the enumeration degrees.
J. Symb. Log., 2012

Cupping and definability in the local structure of the enumeration degrees.
J. Symb. Log., 2012

The high/low hierarchy in the local structure of the omega-enumeration degrees.
Ann. Pure Appl. Log., 2012

2011
Splitting and nonsplitting in the Σ<sub>2</sub><sup>0</sup> enumeration degrees.
Theor. Comput. Sci., 2011

Kalimullin Pairs of §02 w-Enumeration Degrees.
Int. J. Softw. Informatics, 2011

2010
The limitations of cupping in the local structure of the enumeration degrees.
Arch. Math. Log., 2010

2009
Cupping Delta<sub>2</sub><sup>0</sup> enumeration degrees to 0<sub> <i>e</i></sub>'.
Math. Struct. Comput. Sci., 2009

A non-splitting theorem in the enumeration degrees.
Ann. Pure Appl. Log., 2009

2008
How enumeration reducibility yields extended Harrington non-splitting.
J. Symb. Log., 2008

Randomness, lowness and degrees.
J. Symb. Log., 2008

Total Degrees and Nonsplitting Properties of Enumeration Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2008

Cupping Classes of Enumeration Degrees.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Genericity and Non-bounding in the Enumeration degrees.
J. Log. Comput., 2007

The Strongest Nonsplitting Theorem.
Proceedings of the Theory and Applications of Models of Computation, 2007

Working with the <i>LR</i> Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2007

Cupping D<sub>2</sub><sup>0</sup> Enumeration Degrees to 0 <sub> <i>e</i> </sub>'.
Proceedings of the Computation and Logic in the Real World, 2007

2006
A Generic Set That Does Not Bound a Minimal Pair.
Proceedings of the Theory and Applications of Models of Computation, 2006


  Loading...