scientific article; zbMATH DE number 7139148
From MaRDI portal
Publication:4973206
zbMATH Open1438.03012MaRDI QIDQ4973206FDOQ4973206
Publication date: 2 December 2019
Full work available at URL: http://mathnet.ru/eng/vngu471
Title of this publication is not available (Why is that?)
Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)
Cited In (6)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computable positive and Friedberg numberings in hyperarithmetic
- Computable numberings of families of infinite sets
- Partial decidable presentations in hyperarithmetic
- An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
Recommendations
- Friedberg splittings of recursively enumerable sets 👍 👎
- A note on direct sums of Friedbergnumberings 👍 👎
- An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering 👍 👎
- Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering 👍 👎
- Friedberg numberings in the Ershov hierarchy 👍 👎
- Friedberg numberings in the Ershov hierarchy 👍 👎
- Friedberg numberings of families of partial computable functionals 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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 Q4973206)
