The enumeration spectrum hierarchy of <i>n</i>‐families
M. Kh. FaĭzrahmanovDepartment of Mathematics and Mechanics Kazan (Volga Region) Federal University 420008 Kazan RussiaI. Sh. KalimullinDepartment of Mathematics and Mechanics Kazan (Volga Region) Federal University 420008 Kazan Russia
2016en
ABI
Annotatsiya
We introduce a hierarchy of sets which can be derived from the integers using countable collections. Such families can be coded into countable algebraic structures preserving their algorithmic properties. We prove that for different finite levels of the hierarchy the corresponding algebraic structures have different classes of possible degree spectra.
Hali tarjima qilinmagan
Identifikatorlar
Iqtiboslar va manbalar
2 ta iqtibos0 ta foydalanilgan manba