scientific article; zbMATH DE number 3260769
From MaRDI portal
Publication:5546784
Cited in
(13)- Universal generalized computable numberings and hyperimmunity
- Some absolute properties of \(A\)-computable numberings
- Precomplete numberings
- Weakly precomplete equivalence relations in the Ershov hierarchy
- Generalized computable universal numberings
- On computable numberings of families of Turing degrees
- Effectively infinite classes of numberings and fixed point theorems
- Some properties of precompletely and positively numbered sets
- A family whose computable numberings are all complete
- Control structures in computable numberings and the completion operator
- On e-principal and e-complete numberings
- Relative completeness of arithmetical numberings
- Recursion theorems in numbered sets
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 Q5546784)
