scientific article; zbMATH DE number 1048039

MaRDI QIDQ4348125zbMATH OpenFDO

Authors S. Barry Cooper

Publication date 31 March 1998

zbMATH Keywords

automorphismsbiinterpretabilitycomputably enumerable degreesdegrees of unsolvabilityrelative Turing computabilityrigiditysurveyTuring definabilityTuring degreesTuring reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• scientific article; zbMATH DE number 1909828
• Gödel's theorem and information
• Gödel incompleteness theorems and the limits of their applicability. I
• scientific article; zbMATH DE number 1136098

Cited in

(2)

• scientific article; zbMATH DE number 1136098 (Why is no real title available?)
• Forbidden information

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 Q4348125)