枚举可约性与可计算结构理论

{"title":"枚举可约性与可计算结构理论","authors":"Alexandra A. Soskova, M. Soskova","doi":"10.1007/978-3-319-50062-1_19","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Enumeration Reducibility and Computable Structure Theory\",\"authors\":\"Alexandra A. Soskova, M. Soskova\",\"doi\":\"10.1007/978-3-319-50062-1_19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":309016,\"journal\":{\"name\":\"Computability and Complexity\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computability and Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-50062-1_19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computability and Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-50062-1_19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}