Decidability and undecidability in the enumerable Turing degrees
From MaRDI portal
Publication:2784783
zbMATH Open1004.03034MaRDI QIDQ2784783
Publication date: 16 February 2003
Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (11)
Title not available (Why is that?) ⋮ An extension of the recursively enumerable Turing degrees ⋮ Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine ⋮ Title not available (Why is that?) ⋮ TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE ⋮ Undecidability and 1-types in the recursively enumerable degrees ⋮ Every incomplete computably enumerable truth-table degree is branching ⋮ Title not available (Why is that?) ⋮ From decidability to undecidability by considering regular sets of instances ⋮ Turing determinacy and the continuum hypothesis ⋮ Low level nondefinability results: domination and recursive enumeration
This page was built for publication: Decidability and undecidability in the enumerable Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784783)
