Pages that link to "Item:Q695803"
From MaRDI portal
The following pages link to Positive undecidable numberings in the Ershov hierarchy (Q695803):
Displaying 11 items.
- The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
- Positive presentations of families relative to \(e\)-oracles (Q1617982) (← links)
- Computable positive and Friedberg numberings in hyperarithmetic (Q2213918) (← links)
- Computable numberings of families of infinite sets (Q2300737) (← links)
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy (Q2313294) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Rogers semilattices with least and greatest elements in the Ershov hierarchy (Q2680581) (← links)
- Some properties of the numberings of various classes in the Ershov hierarchy (Q2898987) (← links)
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings (Q5741390) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5899647) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5919177) (← links)