Families Without Minimal Numberings

Simple item page
dc.contributor.authorAbeshev, Kuanysh
dc.contributor.authorBadaev, Serikzhan
dc.contributor.authorMustafa, Manat
dc.date.accessioned2015-12-25T04:37:03Z
dc.date.available2015-12-25T04:37:03Z
dc.date.issued2014
dc.description.abstractIt is proved that for any nonzero computable ordinal and its arbitrary notation a, there exists a Σ − 1a -computable family without minimal computable numberings.
dc.identifier.citationAbeshev, K.S., Badaev, S.A. & Mustafa, M. Families Without Minimal Numberings. Algebra Logic 53, 271–286 (2014). https://doi.org/10.1007/s10469-014-9290-9en
dc.identifier.doihttps://doi.org/10.1007/s10469-014-9290-9
dc.identifier.urihttp://nur.nu.edu.kz/handle/123456789/969
dc.language.isoenen
dc.publisherSpringer Nature
dc.sourceAlgebra and Logic
dc.subjectMathematicsen
dc.subjectComputable Numberingen
dc.subjectErshov Hierarchyen
dc.subjectMinimal Numberingen
dc.titleFamilies Without Minimal Numberingsen
dc.typeArticleru_RU

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Familis without minimal numberings.pdf
Size:
212.56 KB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Articles