Pages that link to "Item:Q4032867"

The following pages link to The theory of the recursively enumerable weak truth-table degrees is undecidable (Q4032867):

Displaying 16 items.

• The theory of the \(\alpha \) degrees is undecidable (Q607833) (← links)
• Splitting theorems in recursion theory (Q1314544) (← links)
• Boolean pairs formed by the \(\Delta_ n^ 0\)-sets (Q1368583) (← links)
• Classes bounded by incomplete sets (Q1602854) (← 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)
• The last question on recursively enumerable \(m\)-degrees (Q1908450) (← links)
• Weak truth table degrees of structures (Q2354621) (← links)
• Cupping and noncapping in the r.e. weak truth table and turing degrees (Q3755448) (← links)
• (Q4835608) (← links)
• 1998–99 Annual Meeting of the Association for Symbolic Logic (Q4940738) (← links)
• 1999 European Summer Meeting of the Association for Symbolic Logic (Q4953838) (← links)
• The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
• (Q5441071) (← links)
• Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices (Q5687321) (← links)
• Every incomplete computably enumerable truth-table degree is branching (Q5931217) (← links)