{"title":"On Splits of Computably Enumerable Sets","authors":"Peter A. Cholak","doi":"10.1007/978-3-319-50062-1_31","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computability and Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-50062-1_31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}