Pages that link to "Item:Q3843613"
From MaRDI portal
The following pages link to Reducibility and Completeness for Sets of Integers (Q3843613):
Displaying 50 items.
- Badness and jump inversion in the enumeration degrees (Q412060) (← links)
- Immunity properties and strong positive reducibilities (Q535145) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Computing degrees of unsolvability (Q770790) (← links)
- Strong enumeration reducibilities (Q850805) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density (Q1092896) (← links)
- Infima in the recursively enumerable weak truth table degrees (Q1130238) (← links)
- The \(n\)-rea enumeration degrees are dense (Q1204114) (← links)
- Complexity properties of recursively enumerable sets and \(sQ\)-completeness (Q1277538) (← links)
- Branching in the enumeration degrees of the \(\Sigma_2^0\) sets (Q1293973) (← links)
- On \(sQ\)-completeness of recursively enumerable sets (Q1316903) (← links)
- Quasi-minimal enumeration degrees and minimal Turing degrees (Q1568759) (← links)
- Classes bounded by incomplete sets (Q1602854) (← links)
- Enumeration 1-genericity in the local enumeration degrees (Q1633891) (← links)
- Density of the cototal enumeration degrees (Q1706269) (← links)
- On restricted forms of enumeration reducibility (Q1814011) (← links)
- Fragments of the theory of the enumeration degrees (Q2020402) (← links)
- Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees (Q2204365) (← links)
- Stochastic \(\lambda\)-calculi: an extended abstract (Q2250553) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- Characterizing the continuous degrees (Q2279952) (← links)
- There exists a maximal 3-c.e. enumeration degree (Q2382237) (← links)
- Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees (Q2430010) (← links)
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees (Q2453064) (← links)
- C-quasi-minimal enumeration degrees below \(\mathbf c'\) (Q2491075) (← links)
- On the structures inside truth-table degrees (Q2747717) (← links)
- INITIAL SEGMENTS OF THE ENUMERATION DEGREES (Q2805039) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- There Are No Maximal d.c.e. wtt-degrees (Q2970974) (← links)
- Is it harder to factor a polynomial or to find a root? (Q3053472) (← links)
- Noncappable enumeration degrees below <b>0</b><sub><i>e</i></sub><sup>′</sup> (Q3128477) (← links)
- Computability in Symbolic Dynamics (Q3188248) (← links)
- Jumps of quasi-minimal enumeration degrees (Q3726105) (← links)
- T-Degrees, Jump Classes, and Strong Reducibilities (Q3778736) (← links)
- Deficiency Sets and Bounded Information Reducibilities (Q3895447) (← links)
- Recursive Linear Orders with Incomplete Successivities (Q3977226) (← links)
- A Theorem on Intermediate Reducibilities (Q4047539) (← links)
- Recursively enumerable sets and degrees (Q4184825) (← links)
- Contiguity and distributivity in the enumerable Turing degrees (Q4382472) (← links)
- Interpreting true arithmetic in the local structure of the enumeration degrees (Q4899167) (← links)
- (Q4993802) (← links)
- RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS (Q5070462) (← links)
- A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES (Q5082054) (← links)
- (Q5090490) (← links)
- Computing sets from all infinite subsets (Q5158110) (← links)
- Vladimir Andreevich Uspensky (27/11/1930–27/6/2018) (Q5220248) (← links)
- (Q5228543) (← links)
- Definability via Kalimullin pairs in the structure of the enumeration degrees (Q5247021) (← links)
- Splittings of effectively speedable sets and effectively levelable sets (Q5311714) (← links)
