Pages that link to "Item:Q688787"

The following pages link to Undecidability and 1-types in the recursively enumerable degrees (Q688787):

Displaying 16 items.

• Incomparable prime ideals of recursively enumerable degrees (Q688789) (← links)
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical (Q802550) (← links)
• Coding in the partial order of enumerable sets (Q1380333) (← links)
• Definability in the enumeration degrees (Q1387092) (← links)
• Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201) (← links)
• The recursively enumerable degrees have infinitely many one-types (Q1823931) (← links)
• The discontinuity of splitting in the recursively enumerable degrees (Q1902338) (← links)
• Interpreting true arithmetic in the theory of the r.e. truth table degrees (Q1902619) (← links)
• Undecidable fragments of elementary theories (Q1906521) (← links)
• The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations (Q1921269) (← links)
• Definability in the Recursively Enumerable Degrees (Q3128481) (← links)
• Degree Structures: Local and Global Investigations (Q3412461) (← links)
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (Q4211072) (← links)
• Generalized nonsplitting in the recursively enumerable degrees (Q4358047) (← links)
• 1996–97 Annual Meeting of the Association for Symbolic Logic (Q4372927) (← links)
• The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees (Q4876314) (← links)