Pages that link to "Item:Q3839947"

The following pages link to Interpretability and Definability in the Recursively Enumerable Degrees (Q3839947):

Displaying 41 items.

• Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes (Q409326) (← links)
• Embedding and coding below a 1-generic degree (Q558421) (← links)
• Differences between resource bounded degree structures (Q558725) (← links)
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees (Q764275) (← links)
• Mass problems associated with effectively closed sets (Q765664) (← links)
• Elementary differences among jump classes (Q1007245) (← links)
• Computably enumerable sets and quasi-reducibility (Q1295419) (← links)
• Coding in the partial order of enumerable sets (Q1380333) (← links)
• Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201) (← links)
• On the jumps of the degrees below a recursively enumerable degree (Q1704085) (← links)
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees (Q1840456) (← links)
• Turing computability: structural theory (Q2036465) (← links)
• The theory of ceers computes true arithmetic (Q2187270) (← links)
• Interpretability degrees of finitely axiomatized sequential theories (Q2436609) (← links)
• The \(\omega\)-Turing degrees (Q2453074) (← links)
• The existence of high nonbounding degrees in the difference hierarchy (Q2576939) (← links)
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\) (Q2862196) (← links)
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures (Q2909622) (← links)
• The Turing degrees below generics and randoms (Q2921026) (← links)
• A Rigid Cone in the Truth-Table Degrees with Jump (Q2970975) (← links)
• Coding true arithmetic in the Medvedev and Muchnik degrees (Q3083139) (← links)
• Degrees of Unsolvability: A Tutorial (Q3195683) (← links)
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
• On the definable ideal generated by nonbounding c.e. degrees (Q3370764) (← links)
• Hierarchy of Computably Enumerable Degrees II (Q3380356) (← links)
• Degree Structures: Local and Global Investigations (Q3412461) (← links)
• MASS PROBLEMS AND HYPERARITHMETICITY (Q3521596) (← links)
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES (Q3521597) (← links)
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP (Q3521600) (← links)
• Interpreting true arithmetic in the -enumeration degrees (Q3570161) (← links)
• Definability in the Local Theory of the ω-Enumeration Degrees (Q3576056) (← links)
• A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (Q4637942) (← links)
• A join theorem for the computably enumerable degrees (Q4813778) (← links)
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796) (← links)
• Interpreting true arithmetic in the local structure of the enumeration degrees (Q4899167) (← links)
• (Q4993819) (← links)
• Extensions of two constructions of Ahmad (Q5061391) (← links)
• Definability via Kalimullin pairs in the structure of the enumeration degrees (Q5247021) (← links)
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES (Q5485749) (← links)
• CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES (Q5858920) (← links)
• On cupping and Ahmad pairs (Q6642878) (← links)