{"id":"https://openalex.org/W1591111204","doi":"https://doi.org/10.3217/jucs-003-03-0172","title":"Difference Splittings of Recursively Enumerable Sets","display_name":"Difference Splittings of Recursively Enumerable Sets","publication_year":2020,"publication_date":"2020-04-07","ids":{"openalex":"https://openalex.org/W1591111204","doi":"https://doi.org/10.3217/jucs-003-03-0172","mag":"1591111204"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.9181","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jucs.org/jucs_3_3/difference_splittings_of_recursively/Arslanov_A.pdf","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.3217/jucs-003-03-0172","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010683006","display_name":"Asat Arslanov","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Asat Arslanov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5010683006"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00257028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.974604606628418},{"id":"https://openalex.org/keywords/semilattice","display_name":"Semilattice","score":0.8408631086349487},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.8079057931900024},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.7384873032569885},{"id":"https://openalex.org/keywords/distributive-property","display_name":"Distributive property","score":0.7302083373069763},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5925480127334595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5884995460510254},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.48922228813171387},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3562172055244446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3191528916358948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2612074017524719},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1876823902130127},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.039172470569610596}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.974604606628418},{"id":"https://openalex.org/C132170107","wikidata":"https://www.wikidata.org/wiki/Q834585","display_name":"Semilattice","level":3,"score":0.8408631086349487},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.8079057931900024},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.7384873032569885},{"id":"https://openalex.org/C11821877","wikidata":"https://www.wikidata.org/wiki/Q187959","display_name":"Distributive property","level":2,"score":0.7302083373069763},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5925480127334595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5884995460510254},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.48922228813171387},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3562172055244446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3191528916358948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2612074017524719},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1876823902130127},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.039172470569610596},{"id":"https://openalex.org/C207405024","wikidata":"https://www.wikidata.org/wiki/Q207348","display_name":"Semigroup","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.9181","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jucs.org/jucs_3_3/difference_splittings_of_recursively/Arslanov_A.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.5859","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.5859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.auckland.ac.nz/CDMTCS//researchreports/011splitting.pdf","raw_type":"text"},{"id":"pmh:oai:researchspace.auckland.ac.nz:2292/3520","is_oa":false,"landing_page_url":"https://hdl.handle.net/2292/3520","pdf_url":null,"source":{"id":"https://openalex.org/S7407055463","display_name":"ResearchSpace (University of Auckland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I154130895","host_organization_name":"University of Auckland","host_organization_lineage":["https://openalex.org/I154130895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial","raw_type":"Technical Report"},{"id":"doi:10.3217/jucs-003-03-0172","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-003-03-0172","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"DataPaper"}],"best_oa_location":{"id":"doi:10.3217/jucs-003-03-0172","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-003-03-0172","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"DataPaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1483777631","https://openalex.org/W1597872305","https://openalex.org/W1969635382","https://openalex.org/W1987574007","https://openalex.org/W2023215355","https://openalex.org/W2025135609","https://openalex.org/W2031066297","https://openalex.org/W2038443311","https://openalex.org/W2045263624","https://openalex.org/W2048767471","https://openalex.org/W2056414301","https://openalex.org/W2087237939","https://openalex.org/W2122086070","https://openalex.org/W2530006810"],"related_works":["https://openalex.org/W2057392475","https://openalex.org/W1493426654","https://openalex.org/W2312614769","https://openalex.org/W2092944937","https://openalex.org/W2122086070","https://openalex.org/W2062249564","https://openalex.org/W2083461990","https://openalex.org/W1982652937","https://openalex.org/W2061274683","https://openalex.org/W2033321489","https://openalex.org/W1972685794","https://openalex.org/W2076082825","https://openalex.org/W2125042382","https://openalex.org/W1992701385","https://openalex.org/W2000784135","https://openalex.org/W2062295175","https://openalex.org/W2496200899","https://openalex.org/W2763576367","https://openalex.org/W2126750620","https://openalex.org/W1963706220"],"abstract_inverted_index":{"We":[0,69],"study":[1],"here":[2,71],"the":[3,25,47,72,101],"degree-theoretic":[4],"structure":[5],"of":[6,9,16,27,29,31,33,49,52,59,115,132,140],"set-theoretical":[7],"splittings":[8],"recursively":[10],"enumerable":[11,56,97],"(r.e.)":[12,98],"sets":[13,35,99,102,139],"into":[14],"di#erences":[15,32],"r.e.":[17,34,50,133,138],"sets.":[18],"As":[19],"a":[20,38],"corollary":[21],"we":[22],"deduce":[23],"that":[24,109,149],"ordering":[26,48],"wtt--degrees":[28,51],"unsolvability":[30],"is":[36,42,119,128],"not":[37,43],"distributive":[39],"semilattice":[40],"and":[41,67,75,87,94,163],"elementarily":[44],"equivalent":[45],"to":[46],"unsolvability.":[53],"Keywords:":[54],"Recursively":[55,96],"sets,":[57],"degrees":[58],"unsolvability,":[60],"weak":[61],"truth":[62],"table":[63],"reducibility.":[64],"1":[65,144,153],"Introduction":[66],"Notation":[68],"review":[70],"main":[73],"notation":[74,86],"notions":[76,88],"which":[77,104],"will":[78],"be":[79,90,158],"used":[80],"in":[81,92],"this":[82],"paper.":[83],"All":[84],"other":[85],"can":[89],"found":[91],"[27]":[93],"[26].":[95],"are":[100,137],"for":[103],"there":[105,136],"exist":[106],"Turing":[107],"machines":[108],"e#ectively":[110],"enumerate":[111],"them.":[112],"The":[113],"set":[114,124],"all":[116],"natural":[117,141],"numbers":[118,142],"denoted":[120],"by":[121],"#.":[122],"A":[123,125,143,150,152],"#":[126,127],"called":[129],"d--r.e.":[130],"(di#erence":[131],"sets)":[134],"if":[135],",A":[145],"2":[146,155],"##":[147],"such":[148],"=":[151],"-A":[154],".":[156],"Let":[157],"{W":[159],"e":[160,165],"}":[161,166],"e##":[162,167],"{#":[164],"be,":[168],"respect...":[169]},"counts_by_year":[],"updated_date":"2026-09-03T10:48:47.769340","created_date":"2025-10-10T00:00:00"}