Pages that link to "Item:Q4032867"

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

Displayed 9 items.

• 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)
• 1998–99 Annual Meeting of the Association for Symbolic Logic (Q4940738) ‎ (← links)
• 1999 European Summer Meeting of the Association for Symbolic Logic (Q4953838) ‎ (← links)
• Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices (Q5687321) ‎ (← links)