default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMariya Ivanova Soskova
Person information
- affiliation: University of Wisconsin, Department of Mathematics, Madison, WI, USA
- affiliation: Sofia University, Faculty of Mathematics and Informatics, Bulgaria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j26]Uri Andrews, Julia F. Knight, Rutger Kuyper, Joseph S. Miller
, Mariya Ivanova Soskova:
Expanding the Reals by continuous Functions Adds no Computational Power. J. Symb. Log. 88(3): 1083-1102 (2023)- [j25]Steffen Lempp, Joseph S. Miller, André Nies, Mariya Ivanova Soskova:
Maximal Towers and Ultrafilter Bases in Computability Theory. J. Symb. Log. 88(3): 1170-1190 (2023) - [j24]Jun Le Goh, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova:
Pa Relative to an Enumeration Oracle. J. Symb. Log. 88(4): 1497-1525 (2023) - [c10]Mariya Ivanova Soskova:
The Relationship Between Local and Global Structure in the Enumeration Degrees. CiE 2023: 17-22 - [i2]Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti:
Minimal covers in the Weihrauch degrees. CoRR abs/2311.12676 (2023) - 2022
- [j23]Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. Comput. 11(3-4): 163 (2022) - [j22]Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya Ivanova Soskova:
Extensions of two constructions of Ahmad. Comput. 11(3-4): 269-297 (2022) - [j21]Hristo Aleksndrov Ganchev, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova:
A Structural Dichotomy in the Enumeration Degrees. J. Symb. Log. 87(2): 527-544 (2022) - 2021
- [i1]Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova:
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). Dagstuhl Reports 11(10): 72-93 (2021)
2010 – 2019
- 2018
- [j20]Joseph S. Miller, Mariya Ivanova Soskova:
Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138]. Ann. Pure Appl. Log. 169(5): 450-462 (2018) - [j19]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:
S. Barry Cooper (1943-2015). Comput. 7(2-3): 103-131 (2018) - [j18]Hristo Aleksndrov Ganchev, Mariya Ivanova Soskova:
The jump hierarchy in the enumeration degrees. Comput. 7(2-3): 179-188 (2018) - [j17]Liliana Badillo, Charles M. Harris, Mariya Ivanova Soskova:
Enumeration 1-Genericity in the Local Enumeration Degrees. Notre Dame J. Formal Log. 59(4): 461-489 (2018) - 2017
- [c9]Alexandra A. Soskova, Mariya Ivanova Soskova:
Enumeration Reducibility and Computable Structure Theory. Computability and Complexity 2017: 271-301 - [c8]Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev:
Nondensity of Double Bubbles in the D.C.E. Degrees. Computability and Complexity 2017: 547-562 - [p1]Mariya Ivanova Soskova:
Introduction. The Incomputable 2017: 1-8 - [e2]S. Barry Cooper, Mariya Ivanova Soskova:
The Incomputable: Journeys Beyond the Turing Barrier. Theory and Applications of Computability, Springer International Publishing 2017, ISBN 978-3-319-43667-8 [contents] - 2016
- [j16]Mariya Ivanova Soskova:
The automorphism group of the enumeration degrees. Ann. Pure Appl. Log. 167(10): 982-999 (2016) - [j15]Mingzhong Cai, Steffen Lempp, Joseph S. Miller, Mariya Ivanova Soskova:
On Kalimullin pairs. Comput. 5(2): 111-126 (2016) - 2015
- [e1]Arnold Beckmann, Victor Mitrana, Mariya Ivanova Soskova:
Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings. Lecture Notes in Computer Science 9136, Springer 2015, ISBN 978-3-319-20027-9 [contents] - 2013
- [j14]S. Barry Cooper, Mariya Ivanova Soskova:
The incomputable. J. Log. Comput. 23(6): 1143-1144 (2013) - [c7]Mariya Ivanova Soskova:
The Turing Universe in the Context of Enumeration Reducibility. CiE 2013: 371-382 - 2012
- [j13]Hristo Ganchev, Mariya Ivanova Soskova:
The high/low hierarchy in the local structure of the omega-enumeration degrees. Ann. Pure Appl. Log. 163(5): 547-566 (2012) - [j12]Hristo Ganchev, Mariya Ivanova Soskova:
Cupping and definability in the local structure of the enumeration degrees. J. Symb. Log. 77(1): 133-158 (2012) - [j11]Hristo Ganchev, Mariya Ivanova Soskova:
Interpreting true arithmetic in the local structure of the enumeration degrees. J. Symb. Log. 77(4): 1184-1194 (2012) - [j10]Hristo Ganchev, Mariya Ivanova Soskova:
Embedding distributive lattices in the Σ02 enumeration degrees. J. Log. Comput. 22(4): 779-792 (2012) - [j9]Mariya Ivanova Soskova, Ivan N. Soskov:
Embedding countable partial orderings in the enumeration degrees and the ω-enumeration degrees. J. Log. Comput. 22(4): 927-952 (2012) - 2011
- [j8]Ivan N. Soskov, Mariya Ivanova Soskova:
Kalimullin Pairs of §02 w-Enumeration Degrees. Int. J. Softw. Informatics 5(4): 637-658 (2011) - [j7]Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Splitting and nonsplitting in the Σ20 enumeration degrees. Theor. Comput. Sci. 412(18): 1669-1685 (2011) - 2010
- [j6]Mariya Ivanova Soskova:
The limitations of cupping in the local structure of the enumeration degrees. Arch. Math. Log. 49(2): 169-193 (2010)
2000 – 2009
- 2009
- [j5]Mariya Ivanova Soskova:
A non-splitting theorem in the enumeration degrees. Ann. Pure Appl. Log. 160(3): 400-418 (2009) - [j4]Mariya Ivanova Soskova, Guohua Wu:
Cupping Delta20 enumeration degrees to 0 e'. Math. Struct. Comput. Sci. 19(1): 169-191 (2009) - 2008
- [j3]George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova:
Randomness, lowness and degrees. J. Symb. Log. 73(2): 559-577 (2008) - [j2]S. Barry Cooper, Mariya Ivanova Soskova:
How enumeration reducibility yields extended Harrington non-splitting. J. Symb. Log. 73(2): 634-655 (2008) - [c6]Mariya Ivanova Soskova:
Cupping Classes of Enumeration Degrees. CiE 2008: 554-566 - [c5]Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Total Degrees and Nonsplitting Properties of Enumeration Degrees. TAMC 2008: 568-578 - 2007
- [j1]Mariya Ivanova Soskova:
Genericity and Non-bounding in the Enumeration degrees. J. Log. Comput. 17(6): 1235-1255 (2007) - [c4]Mariya Ivanova Soskova, Guohua Wu:
Cupping D20 Enumeration Degrees to 0 e '. CiE 2007: 727-738 - [c3]George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova:
Working with the LR Degrees. TAMC 2007: 89-99 - [c2]Mariya Ivanova Soskova, S. Barry Cooper:
The Strongest Nonsplitting Theorem. TAMC 2007: 199-211 - 2006
- [c1]Mariya Ivanova Soskova:
A Generic Set That Does Not Bound a Minimal Pair. TAMC 2006: 746-755
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
