Please use this identifier to cite or link to this item:
|Title:||High minimal pairs in the enumeration degrees||Authors:||Sorbi, A.
|Issue Date:||2009||Citation:||Sorbi, A.,Wu, G.,Yang, Y. (2009). High minimal pairs in the enumeration degrees. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5532 LNCS : 335-344. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-02017-9_36||Abstract:||The natural embedding of the Turing degrees into the enumeration degrees preserves the jump operation, and maps isomorphically the computably enumerable Turing degrees onto the π0 1 enumeration degrees. The embedding does not preserve minimal pairs, though, unless one of the two sides is low. In particular it is known that there exist high minimal pairs of c.e. Turing degrees that do not embed to minimal pairs of e-degrees. We show however that high minimal pairs of π0 1 e-degrees do exist. © Springer-Verlag Berlin Heidelberg 2009.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/104572||ISBN:||9783642020162||ISSN:||03029743||DOI:||10.1007/978-3-642-02017-9_36|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 25, 2021
checked on Nov 18, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.