{"id":"https://openalex.org/W1800613700","doi":"https://doi.org/10.2168/lmcs-12(1:2)2016","title":"Proof equivalence in MLL is PSPACE-complete","display_name":"Proof equivalence in MLL is PSPACE-complete","publication_year":2016,"publication_date":"2016-03-02","ids":{"openalex":"https://openalex.org/W1800613700","doi":"https://doi.org/10.2168/lmcs-12(1:2)2016","mag":"1800613700"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-12(1:2)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(1:2)2016","pdf_url":"https://lmcs.episciences.org/1625/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":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1625/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081519201","display_name":"Willem Heijltjes","orcid":"https://orcid.org/0009-0001-8941-1150"},"institutions":[{"id":"https://openalex.org/I51601045","display_name":"University of Bath","ror":"https://ror.org/002h8g185","country_code":"GB","type":"education","lineage":["https://openalex.org/I51601045"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Willem Heijltjes","raw_affiliation_strings":["University of Bath","#N#\u00a7#N#University of Bath#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bath","institution_ids":["https://openalex.org/I51601045"]},{"raw_affiliation_string":"#N#\u00a7#N#University of Bath#N#","institution_ids":["https://openalex.org/I51601045"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018268658","display_name":"Robin Houston","orcid":"https://orcid.org/0000-0002-9200-488X"},"institutions":[{"id":"https://openalex.org/I4210092225","display_name":"ET Enterprises (United Kingdom)","ror":"https://ror.org/00hsg6w24","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210092225"]},{"id":"https://openalex.org/I51601045","display_name":"University of Bath","ror":"https://ror.org/002h8g185","country_code":"GB","type":"education","lineage":["https://openalex.org/I51601045"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Robin Houston","raw_affiliation_strings":["University of Bath","Kiln Enterprises Ltd"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bath","institution_ids":["https://openalex.org/I51601045"]},{"raw_affiliation_string":"Kiln Enterprises Ltd","institution_ids":["https://openalex.org/I4210092225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6939,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.89618246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"Volume 12, Issue 1","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.9972000122070312,"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.9972000122070312,"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.986299991607666,"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.9842000007629395,"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/linear-logic","display_name":"Linear logic","score":0.7038966417312622},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6667798757553101},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6418282985687256},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6127186417579651},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5982702374458313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5876108407974243},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.575362503528595},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.439145028591156},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.43418365716934204},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.43035751581192017},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.4233986735343933},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4149051010608673},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.39899882674217224},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.23334702849388123},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18178576231002808},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.15743696689605713}],"concepts":[{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.7038966417312622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6667798757553101},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6418282985687256},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6127186417579651},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5982702374458313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5876108407974243},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.575362503528595},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.439145028591156},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.43418365716934204},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.43035751581192017},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.4233986735343933},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4149051010608673},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39899882674217224},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.23334702849388123},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18178576231002808},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.15743696689605713},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-12(1:2)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(1:2)2016","pdf_url":"https://lmcs.episciences.org/1625/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:1510.06178","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1510.06178","pdf_url":"https://arxiv.org/pdf/1510.06178","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:oai:opus.bath.ac.uk:47642","is_oa":true,"landing_page_url":"http://opus.bath.ac.uk/47642/1/LMCS.pdf","pdf_url":"http://opus.bath.ac.uk/47642/1/LMCS.pdf","source":{"id":"https://openalex.org/S4306401631","display_name":"The University of Bath Online Publications Store (The University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Articles"},{"id":"pmh:oai:doaj.org/article:cb5845fe5f8b41228964183a68ac113b","is_oa":true,"landing_page_url":"https://doaj.org/article/cb5845fe5f8b41228964183a68ac113b","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 12, Issue 1 (2016)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-12(1:2)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(1:2)2016","pdf_url":"https://lmcs.episciences.org/1625/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":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1800613700.pdf","grobid_xml":"https://content.openalex.org/works/W1800613700.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W202594192","https://openalex.org/W1484778177","https://openalex.org/W1505631902","https://openalex.org/W1526782485","https://openalex.org/W1595555305","https://openalex.org/W1857767003","https://openalex.org/W1964454590","https://openalex.org/W1982129592","https://openalex.org/W1993205599","https://openalex.org/W1997048861","https://openalex.org/W2000131140","https://openalex.org/W2011039300","https://openalex.org/W2018240380","https://openalex.org/W2021005328","https://openalex.org/W2021289373","https://openalex.org/W2036722182","https://openalex.org/W2070813818","https://openalex.org/W2075367647","https://openalex.org/W2079171825","https://openalex.org/W2127390095","https://openalex.org/W2127478938","https://openalex.org/W2152113165","https://openalex.org/W2158075895","https://openalex.org/W2288986295","https://openalex.org/W2320642266","https://openalex.org/W4214952174"],"related_works":["https://openalex.org/W2026191634","https://openalex.org/W2970311880","https://openalex.org/W4236663059","https://openalex.org/W1536078516","https://openalex.org/W2162177529","https://openalex.org/W2109858088","https://openalex.org/W1984423678","https://openalex.org/W2154884611","https://openalex.org/W1981914472","https://openalex.org/W1504200807"],"abstract_inverted_index":{"MLL":[0,56,79,109],"proof":[1,48,80,106],"equivalence":[2,81,124],"is":[3,24,76,82,97,112],"the":[4,28,38,59,62,95,99,133,137],"problem":[5,30,39,46],"of":[6,20,61,94,101,105,125],"deciding":[7],"whether":[8],"two":[9,63],"proofs":[10],"in":[11,72,128],"multiplicative":[12],"linear":[13],"logic":[14],"are":[15,51],"related":[16],"by":[17],"a":[18,44,85,102,140],"series":[19],"inference":[21],"permutations.":[22],"It":[23],"also":[25],"known":[26],"as":[27],"word":[29],"for":[31,54,108,136],"star-autonomous":[32],"categories.":[33],"Previous":[34],"work":[35,68],"has":[36],"shown":[37,77],"to":[40,43,58,123],"be":[41],"equivalent":[42],"rewiring":[45,142],"on":[47,69],"nets,":[49],"which":[50],"not":[52],"canonical":[53],"full":[55],"due":[57],"presence":[60],"units.":[64],"Drawing":[65],"from":[66,87],"recent":[67],"reconfiguration":[70],"problems,":[71],"this":[73],"paper":[74],"it":[75],"that":[78,98],"PSPACE-complete,":[83],"using":[84],"reduction":[86],"Nondeterministic":[88],"Constraint":[89],"Logic.":[90],"An":[91],"important":[92],"consequence":[93],"result":[96,121],"existence":[100],"satisfactory":[103],"notion":[104],"nets":[107],"with":[110],"units":[111],"ruled":[113],"out":[114],"(under":[115],"current":[116],"complexity":[117],"assumptions).":[118],"The":[119],"PSPACE-hardness":[120],"extends":[122],"normal":[126],"forms":[127],"MELL":[129],"without":[130],"units,":[131],"where":[132],"weakening":[134],"rule":[135],"exponentials":[138],"induces":[139],"similar":[141],"problem.":[143]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}