Please use this identifier to cite or link to this item:
|Title:||Closed left-r.e. sets||Authors:||Jain, S.
|Issue Date:||2011||Citation:||Jain, S.,Stephan, F.,Teutsch, J. (2011). Closed left-r.e. sets. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6648 LNCS : 218-229. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-20877-5_23||Abstract:||A set is called r-closed left-r.e. iff every set r-reducible to it is also a left-r.e. set. It is shown that some but not all left-r.e. cohesive sets are many-one closed left-r.e. sets. Ascending reductions are many-one reductions via an ascending function; left-r.e. cohesive sets are also ascening closed left-r.e. sets. Furthermore, it is shown that there is a weakly 1-generic many-one closed left-r.e. set. © 2011 Springer-Verlag.||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/43289||ISBN:||9783642208768||ISSN:||03029743||DOI:||10.1007/978-3-642-20877-5_23|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 18, 2022
checked on May 12, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.