Pages that link to "Item:Q3546062"

The following pages link to Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy (Q3546062):

Displaying 17 items.

• Numberings in the analytical hierarchy (Q828123) (← links)
• Some absolute properties of \(A\)-computable numberings (Q1731521) (← links)
• Computability theory. Abstracts from the workshop held January 7--13, 2018 (Q1731969) (← links)
• The Rogers semilattices of generalized computable enumerations (Q1745093) (← links)
• Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
• Theories of Rogers semilattices of analytical numberings (Q2030131) (← links)
• Weak reducibility of computable and generalized computable numberings (Q2033333) (← links)
• On universal pairs in the Ershov hierarchy (Q2221958) (← links)
• Lattice properties of Rogers semilattices of compuatble and generalized computable families (Q2285202) (← links)
• Reductions between types of numberings (Q2326424) (← 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)
• Rogers semilattices with least and greatest elements in the Ershov hierarchy (Q2680581) (← 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)
• Rogers semilattices of limitwise monotonic numberings (Q6094148) (← links)