Pages that link to "Item:Q4211072"
From MaRDI portal
The following pages link to The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (Q4211072):
Displaying 20 items.
- Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes (Q409326) (← links)
- The theory of the \(\alpha \) degrees is undecidable (Q607833) (← links)
- Continuity of capping in \(\mathcal C_{\text{bT}}\) (Q947265) (← links)
- A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397) (← links)
- Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201) (← links)
- Fragments of the theory of the enumeration degrees (Q2020402) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable (Q2655138) (← links)
- Degree Structures: Local and Global Investigations (Q3412461) (← links)
- The Π<sub>3</sub>-theory of the -enumeration degrees is undecidable (Q3416114) (← links)
- Principal filters definable by parameters in 𝓔<sub>bT</sub> (Q3616223) (← links)
- (Q3992263) (← links)
- Maximal contiguous degrees (Q4532623) (← links)
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796) (← links)
- (Q4835608) (← links)
- 1998–99 Annual Meeting of the Association for Symbolic Logic (Q4940738) (← links)
- Extensions of two constructions of Ahmad (Q5061391) (← links)
- On the existence of a strong minimal pair (Q5501923) (← links)
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element (Q5945396) (← links)
- On cupping and Ahmad pairs (Q6642878) (← links)
