scientific article; zbMATH DE number 761273

zbMATH Open0820.03025MaRDI QIDQ4835608

Richard A. Shore

Publication date: 3 July 1995

Title of this publication is not available (Why is that?)

zbMATH Keywords

undecidabilitydensityautomorphismsdistributivitylatticesalgebraic structuredefinabilityTuring reducibilityrecursively enumerable setsupper semilatticetruth-table reducibilityinfimaweak truth-table reducibilityembeddings of partial orderingscomplexity of the decision procedure

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Interpreting true arithmetic in the theory of the r.e. truth table degrees

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The \(\omega\)-Turing degrees 👍 👎
• Decidability and undecidability in the enumerable Turing degrees 👍 👎
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures 👍 👎
• Alfred Tarski and undecidable theories 👍 👎
• The theory of the recursively enumerable weak truth-table degrees is undecidable 👍 👎
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable 👍 👎
• The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees 👍 👎
• Undecidability and initial segments of the (r.e.) tt-degrees 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835608)