scientific article; zbMATH DE number 3847370

MaRDI QIDQ3317092zbMATH OpenFDO

Authors Robert Byerly

Publication date 1984

zbMATH Keywords

definability of recursively enumerable sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• scientific article; zbMATH DE number 3847369
• PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
• Definable structures in the lattice of recursively enumerable sets
• scientific article; zbMATH DE number 125241
• scientific article; zbMATH DE number 4004169

Cited in

(4)

• scientific article; zbMATH DE number 3847369 (Why is no real title available?)
• scientific article; zbMATH DE number 23840 (Why is no real title available?)
• scientific article; zbMATH DE number 125241 (Why is no real title available?)
• On the Characterization of Recursively Enumerable Sets as Pseudo- Diophantine

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