Elimination of metarecursion in a theorem of Owings

zbMATH Open1349.03043MaRDI QIDQ5741347FDOQ5741347

Authors: M. V. Dorzhieva 

Publication date: 22 July 2016

Full work available at URL: http://mathnet.ru/eng/vngu325

Recommendations

• scientific article; zbMATH DE number 1791729
• On minimal numerations
• scientific article; zbMATH DE number 7139148
• scientific article; zbMATH DE number 3557769
• \(\Pi_1^0\) classes and minimal degrees

zbMATH Keywords

enumerationanalytical hierarchyminimal numerationpositive numerationFriedberg numeration

Mathematics Subject Classification ID

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

Cited In (3)

• Computable positive and Friedberg numberings in hyperarithmetic
• Computable numberings of families of infinite sets
• Partial decidable presentations in hyperarithmetic

This page was built for publication: Elimination of metarecursion in a theorem of Owings

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