{"id":"https://openalex.org/W4391377568","doi":"https://doi.org/10.1093/logcom/exad082","title":"Computably enumerable equivalence relations via primitive recursive reductions","display_name":"Computably enumerable equivalence relations via primitive recursive reductions","publication_year":2023,"publication_date":"2023-12-22","ids":{"openalex":"https://openalex.org/W4391377568","doi":"https://doi.org/10.1093/logcom/exad082"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exad082","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exad082","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113025908","display_name":"Birzhan Kalmurzayev","orcid":null},"institutions":[{"id":"https://openalex.org/I185571130","display_name":"Al-Farabi Kazakh National University","ror":"https://ror.org/03q0vrn42","country_code":"KZ","type":"education","lineage":["https://openalex.org/I185571130"]},{"id":"https://openalex.org/I171571821","display_name":"Kazakh-British Technical University","ror":"https://ror.org/01rn0fp76","country_code":"KZ","type":"education","lineage":["https://openalex.org/I171571821"]}],"countries":["KZ"],"is_corresponding":true,"raw_author_name":"Birzhan S Kalmurzayev","raw_affiliation_strings":["Kazakh-British Technical University , 59 Tole Bi Street, Almaty, 050000, Kazakhstan and Al-Farabi Kazakh National University, 71 al Farabi Avenue, Almaty, 050040, Kazakhstan"],"affiliations":[{"raw_affiliation_string":"Kazakh-British Technical University , 59 Tole Bi Street, Almaty, 050000, Kazakhstan and Al-Farabi Kazakh National University, 71 al Farabi Avenue, Almaty, 050040, Kazakhstan","institution_ids":["https://openalex.org/I185571130","https://openalex.org/I171571821"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084964581","display_name":"Nikolay Bazhenov","orcid":"https://orcid.org/0000-0002-5834-2770"},"institutions":[{"id":"https://openalex.org/I171571821","display_name":"Kazakh-British Technical University","ror":"https://ror.org/01rn0fp76","country_code":"KZ","type":"education","lineage":["https://openalex.org/I171571821"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Nikolay A Bazhenov","raw_affiliation_strings":["Kazakh-British Technical University , 59 Tole Bi Street, Almaty, 050000, Kazakhstan"],"affiliations":[{"raw_affiliation_string":"Kazakh-British Technical University , 59 Tole Bi Street, Almaty, 050000, Kazakhstan","institution_ids":["https://openalex.org/I171571821"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093367463","display_name":"Alibek M Iskakov","orcid":"https://orcid.org/0009-0005-2550-2079"},"institutions":[{"id":"https://openalex.org/I185571130","display_name":"Al-Farabi Kazakh National University","ror":"https://ror.org/03q0vrn42","country_code":"KZ","type":"education","lineage":["https://openalex.org/I185571130"]},{"id":"https://openalex.org/I171571821","display_name":"Kazakh-British Technical University","ror":"https://ror.org/01rn0fp76","country_code":"KZ","type":"education","lineage":["https://openalex.org/I171571821"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Alibek M Iskakov","raw_affiliation_strings":["Kazakh-British Technical University , 59 Tole Bi Street, Almaty, 050000, Kazakhstan and Al-Farabi Kazakh National University, 71 al Farabi Avenue, Almaty, 050040, Kazakhstan"],"affiliations":[{"raw_affiliation_string":"Kazakh-British Technical University , 59 Tole Bi Street, Almaty, 050000, Kazakhstan and Al-Farabi Kazakh National University, 71 al Farabi Avenue, Almaty, 050040, Kazakhstan","institution_ids":["https://openalex.org/I185571130","https://openalex.org/I171571821"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113025908"],"corresponding_institution_ids":["https://openalex.org/I171571821","https://openalex.org/I185571130"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.202,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59585879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"35","issue":"2","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.9966999888420105,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.8789893388748169},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6474342942237854},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.5864861011505127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5260474681854248},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44710710644721985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44224148988723755},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.4225574731826782}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.8789893388748169},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6474342942237854},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.5864861011505127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5260474681854248},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44710710644721985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44224148988723755},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.4225574731826782}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/logcom/exad082","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exad082","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W62548387","https://openalex.org/W633446433","https://openalex.org/W1486265152","https://openalex.org/W1577586863","https://openalex.org/W1909320839","https://openalex.org/W1980790864","https://openalex.org/W2017531368","https://openalex.org/W2058701006","https://openalex.org/W2068423429","https://openalex.org/W2186033963","https://openalex.org/W2558071339","https://openalex.org/W2574999163","https://openalex.org/W2594352983","https://openalex.org/W2894554472","https://openalex.org/W2911139227","https://openalex.org/W2939890436","https://openalex.org/W2943660833","https://openalex.org/W2949113769","https://openalex.org/W2963065069","https://openalex.org/W2972719540","https://openalex.org/W2983092450","https://openalex.org/W3005968961","https://openalex.org/W3016201751","https://openalex.org/W3043792391","https://openalex.org/W3097762558","https://openalex.org/W3103324540","https://openalex.org/W3164960128","https://openalex.org/W3186371800","https://openalex.org/W3191114160","https://openalex.org/W4220772554","https://openalex.org/W4230007549","https://openalex.org/W4280623891","https://openalex.org/W4389115796","https://openalex.org/W6799049566","https://openalex.org/W6858513625"],"related_works":["https://openalex.org/W1972481159","https://openalex.org/W2037833610","https://openalex.org/W1973052363","https://openalex.org/W1980641386","https://openalex.org/W1555094413","https://openalex.org/W2181593437","https://openalex.org/W2117594216","https://openalex.org/W2007089758","https://openalex.org/W2142539551","https://openalex.org/W2078696977"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"complexity":[2,24],"classification":[3],"of":[4,23,32,103,106,112,144,155,175,178],"computably":[5,179],"enumerable":[6,180],"equivalence":[7],"relations":[8,37],"(or":[9],"ceers,":[10],"for":[11,56],"short)":[12],"has":[13,182],"received":[14],"much":[15],"attention":[16],"in":[17,165],"the":[18,61,70,97,153,173],"recent":[19],"literature.":[20],"A":[21],"measure":[22],"is":[25,48,83,129,163],"typically":[26],"provided":[27],"by":[28,90],"an":[29,116,131],"appropriate":[30],"notion":[31],"a":[33,44,49,119,135,183],"reduction.":[34],"Given":[35],"binary":[36],"$R$":[38,52,82],"and":[39,59,64,118],"$S$":[40,54],"on":[41],"natural":[42],"numbers,":[43],"total":[45],"function":[46,71],"$f$":[47,72],"reduction":[50],"from":[51],"to":[53,87],"if":[55],"arbitrary":[57],"$x$":[58],"$y$,":[60],"conditions":[62],"$x~R~y$":[63],"$f(x)~S~f(y)$":[65],"are":[66],"always":[67],"equivalent.":[68],"If":[69],"can":[73],"be":[74],"chosen":[75],"primitive":[76],"recursive,":[77],"then":[78],"we":[79,123,150,170],"say":[80],"that":[81,125,152,157,172],"primitively":[84],"recursively":[85],"reducible":[86],"$S$,":[88],"denoted":[89],"$R":[91],"\\leq":[92],"_{pr}":[93],"S$.":[94],"We":[95,108,138],"investigate":[96],"degree":[98],"structure":[99,174],"$(\\textbf":[100,126,145,166],"{Ceers},\\leq":[101,127,146,167],"_{pr})$":[102,128],"$\\leq":[104,176],"_{pr}$-degrees":[105,177],"ceers.":[107],"examine":[109],"when":[110],"pairs":[111],"incomparable":[113],"degrees":[114],"have":[115,158],"infimum":[117],"supremum.":[120],"In":[121,148],"particular,":[122,149],"show":[124,171],"neither":[130],"upper":[132],"semilattice":[133],"nor":[134],"lower":[136],"semilattice.":[137],"also":[139],"study":[140],"first-order":[141],"definable":[142,164],"subclasses":[143],"_{pr})$.":[147,168],"prove":[151],"set":[154],"equivalences":[156],"only":[159],"finitely":[160],"many":[161],"classes":[162],"Finally,":[169],"preorders":[181],"hereditarily":[184],"undecidable":[185],"theory.":[186]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}