Universal generalized computable numberings and hyperimmunity
From MaRDI portal
Publication:1703271
DOI10.1007/S10469-017-9454-5zbMATH Open1420.03092OpenAlexW2767700802MaRDI QIDQ1703271FDOQ1703271
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
Recommendations
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Title not available (Why is that?)
- Degrees in Which the Recursive Sets are Uniformly Recursive
- Generalized computable numerations and nontrivial Rogers semilattices
- Title not available (Why is that?)
- Computability and numberings
- Title not available (Why is that?)
- Generalized computable universal numberings
- On the limit property of the greatest element in the Rogers semilattice
- Title not available (Why is that?)
Cited In (10)
- Some absolute properties of \(A\)-computable numberings
- Positive presentations of families relative to \(e\)-oracles
- On \(p \)-universal and \(p \)-minimal numberings
- Extremal numberings and fixed point theorems
- Weak reducibility of computable and generalized computable numberings
- Lattice properties of Rogers semilattices of compuatble and generalized computable families
- Minimal generalized computable numberings and families of positive preorders
- Some properties of precompletely and positively numbered sets
- Khutoretskii's theorem for generalized computable families
- Generalized computable universal 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)
