The following pages link to M. Kh. Faizrakhmanov (Q465107):
Displaying 13 items.
- On arithmetical level of the class of superhigh sets (Q465108) (← links)
- (Q646829) (redirect page) (← links)
- Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy (Q646830) (← links)
- A semilattice generated by superlow computably enumerable degrees (Q646847) (← links)
- Turing jumps in the Ershov hierarchy (Q695781) (← links)
- A hierarchy of classes of families and \(n\)-low degrees (Q904326) (← links)
- Universal generalized computable numberings and hyperimmunity (Q1703271) (← links)
- Positive presentations of families in relation to reducibility with respect to enumerability (Q1731525) (← links)
- Computable positive and Friedberg numberings in hyperarithmetic (Q2213918) (← links)
- Semidecidable numberings in admissible sets (Q2213938) (← links)
- Some properties of the upper semilattice of computable families of computably enumerable sets (Q2246822) (← links)
- Khutoretskii's theorem for generalized computable families (Q2300906) (← links)
- Universal computable enumerations of finite classes of families of total functions (Q2363401) (← links)
