{"id":"https://openalex.org/W6966510432","doi":"https://doi.org/10.4230/lipics.fscd.2025.25","title":"Completeness of the Decreasing Diagrams Method for Proving Confluence of Rewriting Systems of the Least Uncountable Cardinality","display_name":"Completeness of the Decreasing Diagrams Method for Proving Confluence of Rewriting Systems of the Least Uncountable Cardinality","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6966510432","doi":"https://doi.org/10.4230/lipics.fscd.2025.25"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23640","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2025.25","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol337-fscd2025/LIPIcs.FSCD.2025.25/LIPIcs.FSCD.2025.25.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol337-fscd2025/LIPIcs.FSCD.2025.25/LIPIcs.FSCD.2025.25.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ivanov, Ievgen","orcid":null},"institutions":[{"id":"https://openalex.org/I189238007","display_name":"Taras Shevchenko National University of Kyiv","ror":"https://ror.org/02aaqv166","country_code":"UA","type":"education","lineage":["https://openalex.org/I189238007"]}],"countries":["UA"],"is_corresponding":true,"raw_author_name":"Ivanov, Ievgen","raw_affiliation_strings":["Taras Shevchenko National University of Kyiv, Ukraine"],"affiliations":[{"raw_affiliation_string":"Taras Shevchenko National University of Kyiv, Ukraine","institution_ids":["https://openalex.org/I189238007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189238007"],"apc_list":null,"apc_paid":null,"fwci":2.7855,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.93249305,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.867900013923645,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.867900013923645,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.049300000071525574,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.024399999529123306,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.8788999915122986},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.8450000286102295},{"id":"https://openalex.org/keywords/uncountable-set","display_name":"Uncountable set","score":0.7192000150680542},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6988000273704529},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6456000208854675},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5882999897003174},{"id":"https://openalex.org/keywords/hol","display_name":"HOL","score":0.5311999917030334},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4334000051021576}],"concepts":[{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.8788999915122986},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8450000286102295},{"id":"https://openalex.org/C142399903","wikidata":"https://www.wikidata.org/wiki/Q1128796","display_name":"Uncountable set","level":3,"score":0.7192000150680542},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6988000273704529},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6456000208854675},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5882999897003174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5870000123977661},{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.5311999917030334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4681999981403351},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4334000051021576},{"id":"https://openalex.org/C102315432","wikidata":"https://www.wikidata.org/wiki/Q649732","display_name":"Formal system","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31610000133514404},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.30079999566078186},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C94020503","wikidata":"https://www.wikidata.org/wiki/Q12916","display_name":"Real number","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C55508974","wikidata":"https://www.wikidata.org/wiki/Q190763","display_name":"Venn diagram","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C2778408900","wikidata":"https://www.wikidata.org/wiki/Q1329258","display_name":"Cardinal number (linguistics)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.2597000002861023}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23640","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2025.25","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol337-fscd2025/LIPIcs.FSCD.2025.25/LIPIcs.FSCD.2025.25.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.fscd.2025.25","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fscd.2025.25","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23640","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2025.25","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol337-fscd2025/LIPIcs.FSCD.2025.25/LIPIcs.FSCD.2025.25.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.7118651866912842}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6966510432.pdf","grobid_xml":"https://content.openalex.org/works/W6966510432.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,120],"show":[1],"that":[2,12,57,86],"every":[3],"confluent":[4,29],"abstract":[5],"rewriting":[6],"system":[7],"(ARS)":[8],"of":[9,28,41,49,76,96,101,111,126,130,148,156],"the":[10,16,22,26,38,39,42,47,60,63,80,87,131,142,154],"cardinality":[11],"does":[13],"not":[14,71],"exceed":[15],"first":[17],"uncountable":[18],"cardinal":[19],"belongs":[20],"to":[21,103],"class":[23,27],"DCR\u2083,":[24],"i.e.":[25],"ARS":[30,97,112],"for":[31,73,93],"which":[32],"confluence":[33,75,95],"can":[34],"be":[35],"proved":[36],"with":[37,67],"help":[40],"decreasing":[43,64,88],"diagrams":[44,65,89],"method":[45,66,90],"using":[46,138],"set":[48],"labels":[50,69],"{0,1,2}":[51],"ordered":[52],"in":[53,134,153],"such":[54,77],"a":[55,122,127],"way":[56],"0<1<2":[58],"(in":[59],"general":[61],"case,":[62],"two":[68],"is":[70,91,151],"sufficient":[72,92],"proving":[74],"ARS).":[78],"Under":[79],"Continuum":[81],"Hypothesis":[82],"this":[83,149],"result":[84,133],"implies":[85],"establishing":[94],"on":[98,113],"many":[99],"structures":[100],"interest":[102],"applied":[104],"mathematics":[105],"and":[106,141],"various":[107],"interdisciplinary":[108],"fields":[109],"(confluence":[110],"real":[114,117],"numbers,":[115],"continuous":[116],"functions,":[118],"etc.).":[119],"provide":[121],"machine-checked":[123],"formal":[124],"proof":[125,136],"formalized":[128],"version":[129,147],"main":[132],"Isabelle":[135],"assistant":[137],"HOL":[139],"logic":[140],"HOL-Cardinals":[143],"theory.":[144],"An":[145],"extended":[146],"formalization":[150],"available":[152],"Archive":[155],"Formal":[157],"Proofs.":[158]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}