{"title":"m-topped度","authors":"R. Downey, Noam Greenberg","doi":"10.2307/j.ctvss3wsw.9","DOIUrl":null,"url":null,"abstract":"This chapter assesses m-topped degrees. The notion of m-topped degrees comes from a general study of the interaction between Turing reducibility and stronger reducibilities among c.e. sets. For example, this study includes the contiguous degrees. A c.e. Turing degree d is m-topped if it contains a greatest degree among the many one degrees of c.e. sets in d. Such degrees were constructed in Downey and Jockusch. The dynamics of the cascading phenomenon occurring in the construction of m-topped degrees strongly resemble the dynamics of the embedding of the 1–3–1 lattice in the c.e. degrees. Similar dynamics occurred in the original construction of a noncomputable left–c.e. real with only computable presentations, which was discussed in the previous chapter.","PeriodicalId":297672,"journal":{"name":"A Hierarchy of Turing Degrees","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"m-topped degrees\",\"authors\":\"R. Downey, Noam Greenberg\",\"doi\":\"10.2307/j.ctvss3wsw.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This chapter assesses m-topped degrees. The notion of m-topped degrees comes from a general study of the interaction between Turing reducibility and stronger reducibilities among c.e. sets. For example, this study includes the contiguous degrees. A c.e. Turing degree d is m-topped if it contains a greatest degree among the many one degrees of c.e. sets in d. Such degrees were constructed in Downey and Jockusch. The dynamics of the cascading phenomenon occurring in the construction of m-topped degrees strongly resemble the dynamics of the embedding of the 1–3–1 lattice in the c.e. degrees. Similar dynamics occurred in the original construction of a noncomputable left–c.e. real with only computable presentations, which was discussed in the previous chapter.\",\"PeriodicalId\":297672,\"journal\":{\"name\":\"A Hierarchy of Turing Degrees\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"A Hierarchy of Turing Degrees\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2307/j.ctvss3wsw.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"A Hierarchy of Turing Degrees","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2307/j.ctvss3wsw.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This chapter assesses m-topped degrees. The notion of m-topped degrees comes from a general study of the interaction between Turing reducibility and stronger reducibilities among c.e. sets. For example, this study includes the contiguous degrees. A c.e. Turing degree d is m-topped if it contains a greatest degree among the many one degrees of c.e. sets in d. Such degrees were constructed in Downey and Jockusch. The dynamics of the cascading phenomenon occurring in the construction of m-topped degrees strongly resemble the dynamics of the embedding of the 1–3–1 lattice in the c.e. degrees. Similar dynamics occurred in the original construction of a noncomputable left–c.e. real with only computable presentations, which was discussed in the previous chapter.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
