Pages that link to "Item:Q5419207"

The following pages link to On the existence of universal numberings for finite families of d.c.e. sets (Q5419207):

Displaying 10 items.

• Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
• Rogers semilattices for families of equivalence relations in the Ershov hierarchy (Q2313294) (← links)
• Reductions between types of numberings (Q2326424) (← links)
• Families without minimal numberings (Q2342320) (← links)
• Generalized computable universal numberings (Q2342326) (← links)
• Rogers semilattices with least and greatest elements in the Ershov hierarchy (Q2680581) (← links)
• An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering (Q2899010) (← links)
• A decomposition of the Rogers semilattice of a family of d.c.e. sets (Q3630582) (← links)
• Effective Enumerations of Families of Finite Sets of Natural Numbers (Q3990702) (← links)
• Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings (Q5741390) (← links)