Система будет остановлена для регулярного обслуживания. Пожалуйста, сохраните рабочие данные и выйдите из системы.
Browsing Mathematics by Author "Mustafa, M."
-
Abeshev, K. Sh.; Badaev, S. A.; Mustafa, M.
(2014)
-
Badaev, S. A.; Mustafa, M.; Sorbi, Andrea
(2014)
We show that for every n 1, there exists a 1n -computable family which up to equivalence has exactly one Friedberg numbering which does not induce the least element of the corresponding Rogers semilattice.
-
Mustafa, M.; Sorbi, Andrea
(2012)
We give a su cient condition for an in nite computable family of 1
a sets, to have computable positive but undecidable numberings, where a
is a notation for a nonzero computable ordinal. This extends a theorem
proved ...
-
Badaev, Serikzhan A.; Mustafa, M.
(2012)
Let a be a Kleene's ordinal notation of a nonzero computable ordinal. We give a su cient condition on a, so that for every 1 a {computable family of two embedded sets, i.e. two sets A;B, with A properly contined in B, ...