The following pages link to (Q4795525):
Displaying 10 items.
- Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
- Khutoretskii's theorem for generalized computable families (Q2300906) (← links)
- Generalized computable universal numberings (Q2342326) (← links)
- Minimal generalized computable enumerations and high degrees (Q2400746) (← links)
- Minimal generalized computable numberings and families of positive preorders (Q2680579) (← links)
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings (Q5741390) (← links)
- Effectively infinite classes of numberings of computable families of reals (Q6086824) (← links)
- On the embedding of the first nonconstructive ordinal in the Rogers semilattices (Q6169441) (← links)
- Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets (Q6175230) (← links)
- On Non-principal Arithmetical Numberings and Families (Q6489320) (← links)
