{"title":"A Family with a Single Minimal but Not Least Numbering","authors":"M. Kh. Faizrahmanov","doi":"10.1134/s0037446624020125","DOIUrl":null,"url":null,"abstract":"<p>We prove the existence of a family of computably enumerable sets that,\nup to equivalence,\nhas a unique computable minimal but not least numbering.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1134/s0037446624020125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We prove the existence of a family of computably enumerable sets that,
up to equivalence,
has a unique computable minimal but not least numbering.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
