{"id":"https://openalex.org/W2724706759","doi":"https://doi.org/10.23638/lmcs-13(4:20)2017","title":"Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees","display_name":"Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees","publication_year":2017,"publication_date":"2017-11-30","ids":{"openalex":"https://openalex.org/W2724706759","doi":"https://doi.org/10.23638/lmcs-13(4:20)2017","mag":"2724706759"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(4:20)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(4:20)2017","pdf_url":"https://lmcs.episciences.org/4111/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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/4111/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055476128","display_name":"Marc Bagnol","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marc Bagnol","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055476128"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07196714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 13, 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/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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/multiplicative-function","display_name":"Multiplicative function","score":0.7655985355377197},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7153670787811279},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6275396347045898},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.5666710734367371},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5219616293907166},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.49058905243873596},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4504469633102417},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42249277234077454},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.41829216480255127},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17932066321372986},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16946762800216675}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7655985355377197},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7153670787811279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6275396347045898},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5666710734367371},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5219616293907166},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.49058905243873596},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4504469633102417},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42249277234077454},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.41829216480255127},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17932066321372986},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16946762800216675},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-13(4:20)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(4:20)2017","pdf_url":"https://lmcs.episciences.org/4111/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:arXiv.org:1707.00991","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1707.00991","pdf_url":"https://arxiv.org/pdf/1707.00991","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1707.00991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1707.00991","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(4:20)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(4:20)2017","pdf_url":"https://lmcs.episciences.org/4111/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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2724706759.pdf"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W143396352","https://openalex.org/W1551410202","https://openalex.org/W1576014443","https://openalex.org/W1964454590","https://openalex.org/W1970074386","https://openalex.org/W1986804393","https://openalex.org/W1991188222","https://openalex.org/W2026324637","https://openalex.org/W2036428616","https://openalex.org/W2128713292","https://openalex.org/W2157304063","https://openalex.org/W2488003724","https://openalex.org/W2962840813"],"related_works":["https://openalex.org/W2056975861","https://openalex.org/W2363556447","https://openalex.org/W2089900921","https://openalex.org/W2501849745","https://openalex.org/W2011933350","https://openalex.org/W1510719821","https://openalex.org/W2093708041","https://openalex.org/W2041182800","https://openalex.org/W3169685561","https://openalex.org/W2146997899"],"abstract_inverted_index":{"Given":[0],"a":[1,5,8,49,80,83,103,113,136,181,199],"logic":[2,35,81,156,168],"presented":[3],"in":[4],"sequent":[6],"calculus,":[7],"natural":[9],"question":[10],"is":[11,99,172,226],"that":[12,131,214],"of":[13,15,33,51,67,70,76,89,95,105,116,138,146,166,183,202,217,222],"equivalence":[14,68,87,152,192,220],"proofs:":[16],"to":[17,85,101,150,175,193],"determine":[18],"whether":[19],"two":[20],"given":[21],"proofs":[22,117,184],"are":[23],"equated":[24],"by":[25,48],"any":[26,30],"denotational":[27],"semantics,":[28],"ie":[29],"categorical":[31],"interpretation":[32],"the":[34,74,86,120,141,151,161,215,218,223],"compatible":[36],"with":[37,107,234],"its":[38],"cut-elimination":[39,121],"procedure.":[40],"This":[41],"notion":[42,104,137],"can":[43,57],"usually":[44],"be":[45,58,134],"captured":[46],"syntactically":[47],"set":[50],"rule":[52],"permutations.":[53],"Very":[54],"generally,":[55],"proofnets":[56,139],"defined":[59],"as":[60,206,210],"combinatorial":[61],"objects":[62],"which":[63],"provide":[64],"canonical":[65],"representatives":[66],"classes":[69],"proofs.":[71,207],"In":[72,92],"particular,":[73],"existence":[75],"proof":[77,191,219],"nets":[78],"for":[79,118,140,154],"provides":[82],"solution":[84],"problem":[88,153,221],"this":[90,155],"logic.":[91],"certain":[93],"fragments":[94],"linear":[96,147,167],"logic,":[97,148],"it":[98,112,171],"possible":[100],"give":[102,198],"proofnet":[106],"good":[108],"computational":[109],"properties,":[110],"making":[111],"suitable":[114],"representation":[115,182],"studying":[119],"procedure,":[122],"among":[123],"other":[124],"things.":[125],"It":[126],"has":[127],"recently":[128],"been":[129],"proved":[130],"there":[132],"cannot":[133],"such":[135],"multiplicative":[142],"(with":[143],"units)":[144],"fragment":[145,165,225],"due":[149],"being":[157],"Pspace-complete.":[158],"We":[159,208],"investigate":[160],"multiplicative-additive":[162],"(without":[163],"unit)":[164],"and":[169,197],"show":[170],"closely":[173],"related":[174],"binary":[176,187,203],"decision":[177,188,194,204],"trees:":[178],"we":[179],"build":[180],"based":[185],"on":[186],"trees,":[189],"reducing":[190],"tree":[195],"equivalence,":[196],"converse":[200],"encoding":[201],"trees":[205],"get":[209],"our":[211],"main":[212],"result":[213],"complexity":[216],"studied":[224],"Logspace-complete.":[227],"Comment:":[228],"arXiv":[229],"admin":[230],"note:":[231],"text":[232],"overlap":[233],"arXiv:1502.01993":[235]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}