Pages that link to "Item:Q2300737"
From MaRDI portal
The following pages link to Computable numberings of families of infinite sets (Q2300737):
Displaying 20 items.
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy (Q542199) (← links)
- Positive undecidable numberings in the Ershov hierarchy (Q695803) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- The number of nonequivalent computable indexations for a fixed family of sets (Q1317638) (← links)
- Some absolute properties of \(A\)-computable numberings (Q1731521) (← links)
- Computable positive and Friedberg numberings in hyperarithmetic (Q2213918) (← links)
- Inductive inference and computable numberings (Q2430009) (← 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)
- \(\varepsilon\)-principal numberings (Q3545568) (← links)
- Almost computably enumerable families of sets (Q3600774) (← links)
- On constructive and enumerable sets (Q3712324) (← links)
- Effective Enumerations of Families of Finite Sets of Natural Numbers (Q3990702) (← links)
- (Q4677692) (← links)
- (Q4723718) (← links)
- Rogers semilattices of punctual numberings (Q5048010) (← links)
- Friedberg Numbering in Fragments of Peano Arithmetic and <i>α</i>-Recursion Theory (Q5407044) (← links)
- On decomposition of Gödelnumberings into Friedbergnumberings (Q5896235) (← links)
- Effectively infinite classes of numberings of computable families of reals (Q6086824) (← links)
- Rogers semilattices of limitwise monotonic numberings (Q6094148) (← links)
