Pages that link to "Item:Q1731521"
From MaRDI portal
The following pages link to Some absolute properties of \(A\)-computable numberings (Q1731521):
Displaying 18 items.
- Positive presentations of families relative to \(e\)-oracles (Q1617982) (← links)
- Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
- Absolute and relative properties of negatively numbered families (Q2030136) (← links)
- One-element Rogers semilattices in the Ershov hierarchy (Q2066095) (← links)
- On \(p \)-universal and \(p \)-minimal numberings (Q2123092) (← links)
- Computable positive and Friedberg numberings in hyperarithmetic (Q2213918) (← links)
- Lattice properties of Rogers semilattices of compuatble and generalized computable families (Q2285202) (← links)
- Computable numberings of families of infinite sets (Q2300737) (← links)
- Khutoretskii's theorem for generalized computable families (Q2300906) (← links)
- Generalized computable universal numberings (Q2342326) (← links)
- Minimal generalized computable numberings and families of positive preorders (Q2680579) (← links)
- An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering (Q2899010) (← links)
- \(\varepsilon\)-principal numberings (Q3545568) (← links)
- Effective Enumerations of Families of Finite Sets of Natural Numbers (Q3990702) (← links)
- On the existence of universal numberings for finite families of d.c.e. sets (Q5419207) (← links)
- One note on positive A-computable numberings (Q5876870) (← links)
- On decomposition of Gödelnumberings into Friedbergnumberings (Q5896235) (← links)
- Representations versus numberings: On the relationship of two computability notions (Q5958133) (← links)
