DSpace Repository

Browsing Articles by Author "Sorbi, Andrea"

Browsing Articles by Author "Sorbi, Andrea"

Sort by: Order: Results:

  • 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 ...

Video Guide

Submission guideSubmission guide

Submit your materials for publication to

NU Repository Drive

Browse

My Account