{"id":"https://openalex.org/W2098064994","doi":"https://doi.org/10.1017/s0960129500000797","title":"Causal dependencies in multiplicative linear logic with MIX","display_name":"Causal dependencies in multiplicative linear logic with MIX","publication_year":1995,"publication_date":"1995-09-01","ids":{"openalex":"https://openalex.org/W2098064994","doi":"https://doi.org/10.1017/s0960129500000797","mag":"2098064994"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129500000797","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129500000797","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032765727","display_name":"Andrea Asperti","orcid":"https://orcid.org/0000-0002-9677-6350"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea Asperti","raw_affiliation_strings":["Dip. di Matematica, Universit\u00e1 di Bologna, P.za di Porta S.Donato, 40126, Bologna, Italy. Email:","Dip. di Matematica, Universit\u00e1 di Bologna, P.za di Porta S.Donato, 40126, Bologna, Italy. Email: asperti@cs.unibo.it"],"affiliations":[{"raw_affiliation_string":"Dip. di Matematica, Universit\u00e1 di Bologna, P.za di Porta S.Donato, 40126, Bologna, Italy. Email:","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"Dip. di Matematica, Universit\u00e1 di Bologna, P.za di Porta S.Donato, 40126, Bologna, Italy. Email: asperti@cs.unibo.it","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032765727"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":null,"apc_paid":null,"fwci":2.8407,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.9127165,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"3","first_page":"351","last_page":"380"},"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.9998999834060669,"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.9998999834060669,"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.9991000294685364,"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.9984999895095825,"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.7670844793319702},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7317041754722595},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7303839325904846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6155034303665161},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.5506328344345093},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5481170415878296},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5186182856559753},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5138276219367981},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4680124521255493},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.4362507462501526},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3816570043563843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36722972989082336},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3239523470401764},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1696050763130188}],"concepts":[{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.7670844793319702},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7317041754722595},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7303839325904846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6155034303665161},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.5506328344345093},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5481170415878296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5186182856559753},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5138276219367981},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4680124521255493},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.4362507462501526},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3816570043563843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36722972989082336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3239523470401764},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1696050763130188},{"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":1,"locations":[{"id":"doi:10.1017/s0960129500000797","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129500000797","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7300000190734863,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W38220193","https://openalex.org/W44606644","https://openalex.org/W1504975584","https://openalex.org/W1572370762","https://openalex.org/W2025349135","https://openalex.org/W2057599103","https://openalex.org/W2079171825","https://openalex.org/W2109735044","https://openalex.org/W2113355185","https://openalex.org/W2120950381","https://openalex.org/W2127889926","https://openalex.org/W2151402914","https://openalex.org/W2911865844","https://openalex.org/W4249538237"],"related_works":["https://openalex.org/W2116032385","https://openalex.org/W4288043137","https://openalex.org/W2007362771","https://openalex.org/W2166745846","https://openalex.org/W2735853128","https://openalex.org/W2915293568","https://openalex.org/W1595555305","https://openalex.org/W2460101989","https://openalex.org/W1505631902","https://openalex.org/W2738946037"],"abstract_inverted_index":{"A":[0],"new":[1,98],"correctness":[2],"criterion":[3,22],"for":[4],"discriminating":[5],"Proof":[6,9,30,66,74],"Nets":[7,67],"among":[8,89],"Structures":[10,31,75],"of":[11,29,50,62,100,110],"Multiplicative":[12],"Linear":[13],"Logic":[14],"with":[15],"the":[16,47,86],"MIX":[17],"rule":[18],"is":[19,23],"provided.":[20],"This":[21,80],"inspired":[24],"by":[25,83],"an":[26],"original":[27],"interpretation":[28],"as":[32,38,71,103],"distributed":[33,60,78],"systems,":[34],"and":[35,94,106],"logical":[36,48,90],"formulae":[37,91],"processes.":[39],"The":[40],"computation":[41],"inside":[42,52,92],"a":[43,53,59,97],"system":[44],"corresponds":[45],"to":[46],"flow":[49],"information":[51],"proof,":[54],"that":[55],"is,":[56],"roughly":[57],"speaking,":[58],"version":[61],"Girard's":[63],"token":[64],"trip.":[65],"are":[68],"then":[69],"characterised":[70],"deadlock":[72],"free":[73,77],"(deadlock":[76],"systems).":[79],"result":[81],"follows":[82],"explicitly":[84],"considering":[85],"causal":[87],"dependencies":[88],"proofs,":[93],"it":[95],"provides":[96],"understanding":[99],"notions":[101],"such":[102],"acyclicity,":[104],"chains":[105],"empires":[107],"in":[108],"terms":[109],"concurrent":[111],"computations.":[112]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}