Mariya I. Soskova

From MaRDI portal
Person:1032638

Available identifiers

zbMath Open soskova.mariya-ivanovaWikidataQ57626565 ScholiaQ57626565MaRDI QIDQ1032638

List of research outcomes





PublicationDate of PublicationType
Minimal covers in the Weihrauch degrees2024-10-18Paper
The relationship between local and global structure in the enumeration degrees2024-01-12Paper
PA RELATIVE TO AN ENUMERATION ORACLE2023-12-22Paper
Complexity profiles and generic Muchnik reducibility2023-12-21Paper
Minimal covers in the Weihrauch degrees2023-11-21Paper
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER2023-09-11Paper
MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY2023-09-11Paper
Redundancy of information: lowering dimension2023-07-21Paper
Extensions of two constructions of Ahmad2023-01-12Paper
A structural dichotomy in the enumeration degrees2022-06-15Paper
https://portal.mardi4nfdi.de/entity/Q50049752021-08-03Paper
Fragments of the theory of the enumeration degrees2021-04-23Paper
Computing with Incomplete Information2020-03-04Paper
Characterizing the continuous degrees2019-12-17Paper
The Rado path decomposition theorem2019-12-17Paper
On cototality and the skip operator in the enumeration degrees2019-07-03Paper
Enumeration 1-genericity in the local enumeration degrees2018-12-21Paper
The jump hierarchy in the enumeration degrees2018-09-20Paper
S. Barry Cooper (1943–2015)2018-09-20Paper
Density of the cototal enumeration degrees2018-03-21Paper
The \(\Delta ^0_2\) Turing degrees: automorphisms and definability2017-12-01Paper
The enumeration degrees: local and global structural interactions2017-08-30Paper
Enumeration reducibility and computable structure theory2017-04-04Paper
Nondensity of Double Bubbles in the D.C.E. Degrees2017-04-04Paper
Genericity for Mathias forcing over general Turing ideals2017-01-11Paper
Defining totality in the enumeration degrees2016-07-25Paper
On Kalimullin pairs2016-07-25Paper
The automorphism group of the enumeration degrees2016-07-22Paper
Definability via Kalimullin pairs in the structure of the enumeration degrees2015-04-22Paper
The Turing universe in the context of enumeration reducibility2013-08-05Paper
Interpreting true arithmetic in the local structure of the enumeration degrees2013-01-07Paper
Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees2012-09-05Paper
Embedding distributive lattices in the \(\Sigma ^0_2\) enumeration degrees2012-09-05Paper
Cupping and definability in the local structure of the enumeration degrees2012-04-19Paper
The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees2012-03-13Paper
Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees2011-04-05Paper
The limitations of cupping in the local structure of the enumeration degrees2010-03-02Paper
A non-splitting theorem in the enumeration degrees2009-10-26Paper
Cupping Δ20 enumeration degrees to 0e2009-03-24Paper
Cupping Classes of $\Sigma^0_2$ Enumeration Degrees2008-06-19Paper
Randomness, lowness and degrees2008-06-09Paper
How enumeration reductibility yields extended Harrington non-splitting2008-06-09Paper
Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees2008-05-27Paper
Genericity and Non-bounding in the Enumeration degrees2008-02-07Paper
Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′2007-11-13Paper
Working with the LR Degrees2007-11-13Paper
The Strongest Nonsplitting Theorem2007-11-13Paper
Theory and Applications of Models of Computation2007-04-30Paper

Research outcomes over time

This page was built for person: Mariya I. Soskova