The following pages link to Mariya Ivanova Soskova (Q1032638):
Displaying 47 items.
- (Q503253) (redirect page) (← links)
- Genericity for Mathias forcing over general Turing ideals (Q503254) (← links)
- (Q764274) (redirect page) (← links)
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees (Q764275) (← links)
- A non-splitting theorem in the enumeration degrees (Q1032639) (← links)
- Enumeration 1-genericity in the local enumeration degrees (Q1633891) (← links)
- Density of the cototal enumeration degrees (Q1706269) (← links)
- Fragments of the theory of the enumeration degrees (Q2020402) (← links)
- The limitations of cupping in the local structure of the enumeration degrees (Q2267755) (← links)
- The Rado path decomposition theorem (Q2279931) (← links)
- Characterizing the continuous degrees (Q2279952) (← links)
- Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees (Q2430010) (← links)
- The automorphism group of the enumeration degrees (Q2630830) (← links)
- Embedding distributive lattices in the Formula enumeration degrees (Q2907055) (← links)
- Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees (Q2907064) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- Nondensity of Double Bubbles in the D.C.E. Degrees (Q2970979) (← links)
- Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees (Q3502679) (← links)
- Randomness, lowness and degrees (Q3503755) (← links)
- How enumeration reductibility yields extended Harrington non-splitting (Q3503759) (← links)
- Cupping Classes of $\Sigma^0_2$ Enumeration Degrees (Q3507472) (← links)
- Cupping Δ<sub>2</sub><sup>0</sup> enumeration degrees to 0<sub><i>e</i></sub>′ (Q3616224) (← links)
- The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability (Q4596355) (← links)
- S. Barry Cooper (1943–2015) (Q4683146) (← links)
- The jump hierarchy in the enumeration degrees (Q4683151) (← links)
- Interpreting true arithmetic in the local structure of the enumeration degrees (Q4899167) (← links)
- On cototality and the skip operator in the enumeration degrees (Q4967303) (← links)
- (Q5004975) (← links)
- Extensions of two constructions of Ahmad (Q5061391) (← links)
- A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES (Q5082054) (← links)
- Computing with Incomplete Information (Q5218477) (← links)
- Definability via Kalimullin pairs in the structure of the enumeration degrees (Q5247021) (← links)
- The Turing Universe in the Context of Enumeration Reducibility (Q5326385) (← links)
- The enumeration degrees: Local and global structural interactions (Q5351849) (← links)
- Cupping and definability in the local structure of the enumeration degrees (Q5388723) (← links)
- Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′ (Q5425377) (← links)
- Working with the LR Degrees (Q5425423) (← links)
- The Strongest Nonsplitting Theorem (Q5425433) (← links)
- Genericity and Non-bounding in the Enumeration degrees (Q5441130) (← links)
- On Kalimullin pairs (Q5740204) (← links)
- Defining totality in the enumeration degrees (Q5741445) (← links)
- Theory and Applications of Models of Computation (Q5898927) (← links)
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER (Q6095975) (← links)
- MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY (Q6095978) (← links)
- PA RELATIVE TO AN ENUMERATION ORACLE (Q6180605) (← links)
- Complexity profiles and generic Muchnik reducibility (Q6182774) (← links)
- Minimal covers in the Weihrauch degrees (Q6621299) (← links)
