Pages that link to "Item:Q1387092"

The following pages link to Definability in the enumeration degrees (Q1387092):

Displaying 36 items.

• Embedding and coding below a 1-generic degree (Q558421) (← links)
• The theory of the \(\alpha \) degrees is undecidable (Q607833) (← links)
• Bounded enumeration reducibility and its degree structure (Q661285) (← links)
• Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
• Incomparable prime ideals of recursively enumerable degrees (Q688789) (← links)
• Definability with bounded number of bound variables (Q922523) (← links)
• Sets of generator and automorphism bases for the enumeration degrees (Q1295393) (← links)
• Coding in the partial order of enumerable sets (Q1380333) (← links)
• An oracle builder's toolkit (Q1398366) (← links)
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees (Q1840456) (← links)
• Interpreting true arithmetic in the theory of the r.e. truth table degrees (Q1902619) (← links)
• Interpolating \(d\)-r.e. and REA degrees between r.e. degrees (Q1919759) (← links)
• Fragments of the theory of the enumeration degrees (Q2020402) (← links)
• The theory of ceers computes true arithmetic (Q2187270) (← links)
• Enumerations of Turing ideals with applications (Q2277253) (← links)
• Definability for model counting (Q2303508) (← links)
• The automorphism group of the enumeration degrees (Q2630830) (← links)
• Definability aspects of the Denjoy integral (Q2966798) (← links)
• (Q3365576) (← links)
• ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS (Q3379460) (← links)
• The Π₃-theory of the -enumeration degrees is undecidable (Q3416114) (← links)
• Interpreting true arithmetic in the -enumeration degrees (Q3570161) (← links)
• Second Order Definability Via enumerations (Q3982254) (← links)
• Some Special Pairs of Σ2 e-Degrees (Q4224077) (← links)
• Definability and undefinability with real order at the background (Q4508271) (← links)
• (Q4513973) (← links)
• (Q4513977) (← links)
• A combinatorial version of the Svenonius theorem on definability (Q4644608) (← links)
• Interpreting true arithmetic in the local structure of the enumeration degrees (Q4899167) (← links)
• Decomposing Borel functions using the Shore–Slaman join theorem (Q4983474) (← links)
• (Q4993819) (← links)
• Extensions of two constructions of Ahmad (Q5061391) (← links)
• Degrees of unsolvability of continuous functions (Q5311741) (← links)
• The enumeration degrees: Local and global structural interactions (Q5351849) (← links)
• ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
• On cupping and Ahmad pairs (Q6642878) (← links)