Universal generalized computable numberings and hyperimmunity

DOI10.1007/S10469-017-9454-5MaRDI QIDQ1703271zbMATHOpenAlexFDO

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

Recommendations

• Generalized computable universal numberings
• Khutoretskii's theorem for generalized computable families
• Extremal numberings and fixed point theorems
• Minimal generalized computable enumerations and high degrees
• Minimal generalized computable numberings and families of positive preorders

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1531919 (Why is no real title available?)
• scientific article; zbMATH DE number 1390024 (Why is no real title available?)
• scientific article; zbMATH DE number 3260769 (Why is no real title available?)
• Computability and numberings
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Generalized computable numerations and nontrivial Rogers semilattices
• Generalized computable universal numberings
• On the limit property of the greatest element in the Rogers semilattice

Cited in

(10)

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

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

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