Ушбу иш иқтибос қилган ишлар

20 та иш

Иш: Notes on Classes of Minimal Numberings of Arithmetical Set Families

Recursively Enumerable Sets and Degrees
Robert I. Soare
Китоб198710 иқтибос
ABI
Theory of Numberings
Yuri L. Ershov
Боб19996 иқтибос
ABI
On decomposition of Gödelnumberings into Friedbergnumberings
Britta Schinzel
Мақола19824 иқтибос
ABI
Effectively infinite classes of numberings and computable families of reals
M. Kh. Faĭzrahmanov, Z. K. Shchedrikova
Мақола20234 иқтибос
ABI
Rogers Semilattices of Families of Arithmetic Sets
S. A. Badaev, С. С. Гончаров
Мақола20012 иқтибос
ABI
Computability and Numberings
S. A. Badaev, С. С. Гончаров
Боб20072 иқтибос
ABI
Generalized computable numerations and nontrivial rogers semilattices
С. С. Гончаров, Andrea Sorbi
Мақола19972 иқтибос
ABI
Local structure of Rogers semilattices of Σn 0-computable numberings
S. Yu. Podzorov
Мақола20052 иқтибос
ABI
Some effectively infinite classes of enumerations
С. С. Гончаров, Alexander Yakhnis, Vladimir Yakhnis
Мақола19932 иқтибос
ABI
A problem of S. S. Goncharov
S. A. Badaev
Мақола19912 иқтибос
ABI
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
S. A. Badaev, С. С. Гончаров, Andrea Sorbi
Мақола20062 иқтибос
ABI
The enumeration spectrum hierarchy of <i>n</i>‐families
M. Kh. Faĭzrahmanov, I. Sh. Kalimullin
Мақола20162 иқтибос
ABI
Minimal generalized computable enumerations and high degrees
M. Kh. Faĭzrahmanov
Мақола20172 иқтибос
ABI
Khutoretskii’s Theorem for Generalized Computable Families
M. Kh. Faĭzrakhmanov
Мақола20192 иқтибос
ABI
Complexity of Decompositions of Gödel Numberings
Britta Schinzel
Мақола19822 иқтибос
ABI
Creative sets
John Myhill
Мақола19552 иқтибос
ABI
Extremal numberings and fixed point theorems
M. Kh. Faĭzrahmanov
Мақола20222 иқтибос
ABI
Fixed point theorems for minimal numberings
M. Kh. Faĭzrahmanov
Мақола20232 иқтибос
ABI
Сарлавҳасиз
Бошқа1 иқтибос
ABI
Сарлавҳасиз
Бошқа1 иқтибос
ABI