Pages that link to "Item:Q2213918"
From MaRDI portal
The following pages link to Computable positive and Friedberg numberings in hyperarithmetic (Q2213918):
Displaying 8 items.
- Positive undecidable numberings in the Ershov hierarchy (Q695803) (← links)
- Some absolute properties of \(A\)-computable numberings (Q1731521) (← links)
- Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
- Absolute and relative properties of negatively numbered families (Q2030136) (← links)
- Semidecidable numberings in admissible sets (Q2213938) (← links)
- Computable numberings of families of infinite sets (Q2300737) (← links)
- (Q5101339) (← links)
- Friedberg Numbering in Fragments of Peano Arithmetic and <i>α</i>-Recursion Theory (Q5407044) (← links)