{"id":"https://openalex.org/W1964454590","doi":"https://doi.org/10.1145/1094622.1094629","title":"Proof nets for unit-free multiplicative-additive linear logic","display_name":"Proof nets for unit-free multiplicative-additive linear logic","publication_year":2005,"publication_date":"2005-10-01","ids":{"openalex":"https://openalex.org/W1964454590","doi":"https://doi.org/10.1145/1094622.1094629","mag":"1964454590"},"language":"en","primary_location":{"id":"doi:10.1145/1094622.1094629","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1094622.1094629","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1959.4/44467","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102159537","display_name":"Dominic J. D. Hughes","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dominic J. D. Hughes","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107828463","display_name":"Rob J. van Glabbeek","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rob J. Van Glabbeek","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102159537"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":13.7008,"has_fulltext":false,"cited_by_count":83,"citation_normalized_percentile":{"value":0.9874316,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"4","first_page":"784","last_page":"842"},"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/T10142","display_name":"Formal Methods in Verification","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/T11424","display_name":"Security and Verification in Computing","score":0.9876999855041504,"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/mathematics","display_name":"Mathematics","score":0.7317158579826355},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.6808135509490967},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.6676381826400757},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6229215860366821},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5872772932052612},{"id":"https://openalex.org/keywords/combinatorial-proof","display_name":"Combinatorial proof","score":0.5273697376251221},{"id":"https://openalex.org/keywords/analytic-proof","display_name":"Analytic proof","score":0.513127863407135},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.503027617931366},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48038560152053833},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4455641806125641},{"id":"https://openalex.org/keywords/monomial","display_name":"Monomial","score":0.4315348267555237}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7317158579826355},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.6808135509490967},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.6676381826400757},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6229215860366821},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5872772932052612},{"id":"https://openalex.org/C118539577","wikidata":"https://www.wikidata.org/wiki/Q3402784","display_name":"Combinatorial proof","level":2,"score":0.5273697376251221},{"id":"https://openalex.org/C135754263","wikidata":"https://www.wikidata.org/wiki/Q4751136","display_name":"Analytic proof","level":3,"score":0.513127863407135},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.503027617931366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48038560152053833},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4455641806125641},{"id":"https://openalex.org/C11252640","wikidata":"https://www.wikidata.org/wiki/Q243723","display_name":"Monomial","level":2,"score":0.4315348267555237},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1094622.1094629","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1094622.1094629","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.77.1280","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.1280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://boole.stanford.edu/pub/mall.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.5787","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.5787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://boole.stanford.edu/pub/mall-monochrome.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.9491","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.9491","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://boole.stanford.edu/pub/mallnets-lics-with-proofs.pdf","raw_type":"text"},{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/44467","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/44467","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM transactions on computational logic, 6, 4, 784-842","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/44467","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/44467","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM transactions on computational logic, 6, 4, 784-842","raw_type":"http://purl.org/coar/resource_type/c_6501"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1626577172","https://openalex.org/W1884253159","https://openalex.org/W1979324214","https://openalex.org/W2024042018","https://openalex.org/W2025349135","https://openalex.org/W2057599103","https://openalex.org/W2075367647","https://openalex.org/W2078908046","https://openalex.org/W2079171825","https://openalex.org/W2094685149","https://openalex.org/W2102246643","https://openalex.org/W2106988030","https://openalex.org/W2107067818","https://openalex.org/W2122253298","https://openalex.org/W2129290355","https://openalex.org/W2168616680","https://openalex.org/W2485157617","https://openalex.org/W2561675875","https://openalex.org/W2911865844","https://openalex.org/W4230659860","https://openalex.org/W4251852318","https://openalex.org/W4291439952","https://openalex.org/W6632800853","https://openalex.org/W6678984092","https://openalex.org/W6722338012"],"related_works":["https://openalex.org/W4234403895","https://openalex.org/W2007362771","https://openalex.org/W2915293568","https://openalex.org/W2163170048","https://openalex.org/W2722497084","https://openalex.org/W171706349","https://openalex.org/W2736121670","https://openalex.org/W2134137673","https://openalex.org/W1490051504","https://openalex.org/W3013034887"],"abstract_inverted_index":{"A":[0],"cornerstone":[1,97],"of":[2,5,18,43,58,63,78,88,98],"the":[3,15,51,56,76,96,99],"theory":[4],"proof":[6,46,64,90],"nets":[7,47],"for":[8,66],"unit-free":[9,67],"multiplicative":[10],"linear":[11,69,79],"logic":[12,70,80],"(MLL)":[13],"is":[14],"abstract":[16],"representation":[17],"cut-free":[19,44,53],"proofs":[20],"modulo":[21],"inessential":[22],"rule":[23],"commutation.":[24],"The":[25],"only":[26],"known":[27],"extension":[28],"to":[29,36,50,95],"additives,":[30],"based":[31],"on":[32],"monomial":[33,45],"weights,":[34],"fails":[35],"preserve":[37],"this":[38],"key":[39],"feature:":[40],"a":[41,60,85],"host":[42],"can":[48],"correspond":[49],"same":[52],"proof.":[54],"Thus,":[55],"problem":[57],"finding":[59],"satisfactory":[61],"notion":[62],"net":[65,91],"multiplicative-additive":[68],"(MALL)":[71],"has":[72],"remained":[73],"open":[74],"since":[75],"inception":[77],"in":[81],"1986.":[82],"We":[83],"present":[84],"new":[86],"definition":[87],"MALL":[89],"which":[92],"remains":[93],"faithful":[94],"MLL":[100],"theory.":[101]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}