Difference Splittings of Recursively Enumerable Sets

dc.creatorArslanov,Asat
dc.date1997
dc.date.accessioned2024-02-06T12:48:45Z
dc.date.available2024-02-06T12:48:45Z
dc.descriptionWe study here the degree-theoretic structure of set-theoretical splittings of recursively enumerable (r.e.) sets into differences of r.e. sets. As a corollary we deduce that the odering of wtt-degrees of unsolvability of differences of r.e. sets is not a distributive semilattice and is not elementarily equivalent to the ordering of r.e. wtt-degrees of unsolvability.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-003-03-0172
dc.identifierhttps://lib.jucs.org/article/27340/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7125
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 3(3): 172-184
dc.titleDifference Splittings of Recursively Enumerable Sets
dc.typeResearch Article
Файлы