{"id":"https://openalex.org/W4389520186","doi":"https://doi.org/10.46298/lmcs-19(4:22)2023","title":"Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)","display_name":"Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)","publication_year":2023,"publication_date":"2023-12-08","ids":{"openalex":"https://openalex.org/W4389520186","doi":"https://doi.org/10.46298/lmcs-19(4:22)2023"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-19(4:22)2023","is_oa":true,"landing_page_url":"http://dx.doi.org/10.46298/lmcs-19(4:22)2023","pdf_url":"https://lmcs.episciences.org/12672/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/12672/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017299598","display_name":"Andrej Dudenhefner","orcid":"https://orcid.org/0000-0003-1104-444X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andrej Dudenhefner","raw_affiliation_strings":["TU Dortmund University, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017299598"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24180915,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 19, Issue 4","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.9994999766349792,"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.9994999766349792,"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.9879999756813049,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9750999808311462,"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/unification","display_name":"Unification","score":0.7790066003799438},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7201286554336548},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6415050625801086},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6280926465988159},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5907427668571472},{"id":"https://openalex.org/keywords/turing-machine-examples","display_name":"Turing machine examples","score":0.5038120150566101},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.46194157004356384},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4485708773136139},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.43047115206718445},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3863966464996338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3560713529586792},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.3248659372329712},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3235153555870056},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.21042609214782715}],"concepts":[{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.7790066003799438},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7201286554336548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6415050625801086},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6280926465988159},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5907427668571472},{"id":"https://openalex.org/C21176728","wikidata":"https://www.wikidata.org/wiki/Q7854963","display_name":"Turing machine examples","level":5,"score":0.5038120150566101},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.46194157004356384},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4485708773136139},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.43047115206718445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3863966464996338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3560713529586792},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.3248659372329712},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3235153555870056},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.21042609214782715},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-19(4:22)2023","is_oa":true,"landing_page_url":"http://dx.doi.org/10.46298/lmcs-19(4:22)2023","pdf_url":"https://lmcs.episciences.org/12672/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:cae125669d774f50a7f1da230ae9db6c","is_oa":true,"landing_page_url":"https://doaj.org/article/cae125669d774f50a7f1da230ae9db6c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-19(4:22)2023","is_oa":true,"landing_page_url":"http://dx.doi.org/10.46298/lmcs-19(4:22)2023","pdf_url":"https://lmcs.episciences.org/12672/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4389520186.pdf"},"referenced_works_count":59,"referenced_works":["https://openalex.org/W62585087","https://openalex.org/W77390324","https://openalex.org/W1503991720","https://openalex.org/W1538141914","https://openalex.org/W1571481868","https://openalex.org/W1588906418","https://openalex.org/W1592676453","https://openalex.org/W1595372275","https://openalex.org/W1807513822","https://openalex.org/W1856886728","https://openalex.org/W1964952791","https://openalex.org/W1968746567","https://openalex.org/W1993209012","https://openalex.org/W1993695344","https://openalex.org/W2002837892","https://openalex.org/W2012140001","https://openalex.org/W2021217869","https://openalex.org/W2024753238","https://openalex.org/W2025057593","https://openalex.org/W2029917213","https://openalex.org/W2055065270","https://openalex.org/W2066815568","https://openalex.org/W2074954052","https://openalex.org/W2075870487","https://openalex.org/W2091769084","https://openalex.org/W2112044534","https://openalex.org/W2116976042","https://openalex.org/W2118758698","https://openalex.org/W2121576959","https://openalex.org/W2125357395","https://openalex.org/W2154632906","https://openalex.org/W2161843469","https://openalex.org/W2163976959","https://openalex.org/W2166822586","https://openalex.org/W2251958825","https://openalex.org/W2479149412","https://openalex.org/W2503143299","https://openalex.org/W2543198443","https://openalex.org/W2737508986","https://openalex.org/W2769209754","https://openalex.org/W2895878038","https://openalex.org/W2905135108","https://openalex.org/W2907653511","https://openalex.org/W2914336554","https://openalex.org/W2914652008","https://openalex.org/W2943099128","https://openalex.org/W3022449549","https://openalex.org/W3037360470","https://openalex.org/W3173826524","https://openalex.org/W4205394253","https://openalex.org/W4206742702","https://openalex.org/W4214856822","https://openalex.org/W4242790935","https://openalex.org/W4247885407","https://openalex.org/W4251876706","https://openalex.org/W4297241133","https://openalex.org/W4311008361","https://openalex.org/W6891731381","https://openalex.org/W6910357224"],"related_works":["https://openalex.org/W2119421720","https://openalex.org/W1526857708","https://openalex.org/W2348596562","https://openalex.org/W1662868588","https://openalex.org/W2547364878","https://openalex.org/W293759077","https://openalex.org/W165822490","https://openalex.org/W195780958","https://openalex.org/W3014863312","https://openalex.org/W2080640642"],"abstract_inverted_index":{"Semi-unification":[0],"is":[1,41,91,118,142],"the":[2,23,62,79,84,89,98,112,121,136,145],"combination":[3],"of":[4,12,33,51,72,78,83,88,126,132,138,144],"first-order":[5,8],"unification":[6],"and":[7,20,46,86,108],"matching.":[9],"The":[10,37,53,116],"undecidability":[11,127,137],"semi-unification":[13,73],"has":[14],"been":[15],"proven":[16],"by":[17,25,93],"Kfoury,":[18],"Tiuryn,":[19],"Urzyczyn":[21],"in":[22,97],"1990s":[24],"Turing":[26,29,39,63,139],"reduction":[27,40,60,80],"from":[28,61],"machine":[30,64,140],"immortality":[31,141],"(existence":[32],"a":[34,57,130],"diverging":[35],"configuration).":[36],"particular":[38],"intricate,":[42],"uses":[43],"non-computational":[44],"principles,":[45],"involves":[47],"various":[48],"intermediate":[49],"models":[50],"computation.":[52],"present":[54],"work":[55],"gives":[56],"constructive":[58],"many-one":[59,75],"halting":[65],"problem":[66],"to":[67],"semi-unification.":[68],"This":[69],"establishes":[70],"RE-completeness":[71],"under":[74],"reductions.":[76],"Computability":[77],"function,":[81],"constructivity":[82],"argument,":[85],"correctness":[87],"argument":[90,134],"witnessed":[92],"an":[94],"axiom-free":[95],"mechanization":[96,117],"Coq":[99,124],"proof":[100],"assistant.":[101],"Arguably,":[102],"this":[103],"serves":[104],"as":[105],"comprehensive,":[106],"precise,":[107],"surveyable":[109],"evidence":[110],"for":[111,135],"result":[113],"at":[114],"hand.":[115],"incorporated":[119],"into":[120],"existing,":[122],"well-maintained":[123],"library":[125],"proofs.":[128],"Notably,":[129],"variant":[131],"Hooper's":[133],"part":[143],"mechanization.":[146]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}