Universal generalized computable numberings and hyperimmunity

DOI10.1007/S10469-017-9454-5zbMath1420.03092OpenAlexW2767700802MaRDI QIDQ1703271

M. Kh. Faizrakhmanov

Publication date: 2 March 2018

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-017-9454-5

zbMATH Keywords

hyperimmune setgeneralized computable numberinghigh setprecomplete numberinguniversal numbering

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (8)

On \(p \)-universal and \(p \)-minimal numberings ⋮ Positive presentations of families relative to \(e\)-oracles ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ Extremal numberings and fixed point theorems ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Weak reducibility of computable and generalized computable numberings ⋮ Lattice properties of Rogers semilattices of compuatble and generalized computable families ⋮ Khutoretskii's theorem for generalized computable families

Cites Work

• Generalized computable universal numberings
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Universal generalized computable numberings and hyperimmunity