{"id":"https://openalex.org/W2756118055","doi":"https://doi.org/10.1017/s0960129518000117","title":"Subexponentials in non-commutative linear logic","display_name":"Subexponentials in non-commutative linear logic","publication_year":2018,"publication_date":"2018-05-02","ids":{"openalex":"https://openalex.org/W2756118055","doi":"https://doi.org/10.1017/s0960129518000117","mag":"2756118055"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129518000117","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129518000117","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1709.03607","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MAX KANOVICH","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"MAX KANOVICH","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"STEPAN KUZNETSOV","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"STEPAN KUZNETSOV","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"VIVEK NIGAM","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"VIVEK NIGAM","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"ANDRE SCEDROV","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ANDRE SCEDROV","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9913,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.91975634,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"29","issue":"8","first_page":"1217","last_page":"1249"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.3402000069618225,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.3402000069618225,"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.3059000074863434,"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/T10126","display_name":"Logic, programming, and type systems","score":0.27090001106262207,"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/decidability","display_name":"Decidability","score":0.826200008392334},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.699400007724762},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.5138000249862671},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.5098000168800354},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4880000054836273},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.45350000262260437},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.42399999499320984},{"id":"https://openalex.org/keywords/substructural-logic","display_name":"Substructural logic","score":0.3919999897480011}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.826200008392334},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.699400007724762},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5146999955177307},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.5138000249862671},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.5098000168800354},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4880000054836273},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48590001463890076},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.45350000262260437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4424000084400177},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.42399999499320984},{"id":"https://openalex.org/C144760519","wikidata":"https://www.wikidata.org/wiki/Q839490","display_name":"Substructural logic","level":4,"score":0.3919999897480011},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3840999901294708},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38100001215934753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37950000166893005},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.359499990940094},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.3546999990940094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3465999960899353},{"id":"https://openalex.org/C154564781","wikidata":"https://www.wikidata.org/wiki/Q5384236","display_name":"Equational logic","level":3,"score":0.32829999923706055},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.32199999690055847},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.290800005197525},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.28839999437332153},{"id":"https://openalex.org/C178421362","wikidata":"https://www.wikidata.org/wiki/Q176786","display_name":"Intuitionistic logic","level":3,"score":0.259799987077713},{"id":"https://openalex.org/C20693621","wikidata":"https://www.wikidata.org/wiki/Q6667502","display_name":"Logical framework","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0960129518000117","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129518000117","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"},{"id":"pmh:oai:arXiv.org:1709.03607","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1709.03607","pdf_url":"https://arxiv.org/pdf/1709.03607","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1709.03607","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1709.03607","pdf_url":"https://arxiv.org/pdf/1709.03607","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W81761572","https://openalex.org/W87267104","https://openalex.org/W614375011","https://openalex.org/W1495793844","https://openalex.org/W1537907223","https://openalex.org/W1774823771","https://openalex.org/W1978223872","https://openalex.org/W1982129592","https://openalex.org/W2002130184","https://openalex.org/W2004459113","https://openalex.org/W2012615291","https://openalex.org/W2021289373","https://openalex.org/W2023695988","https://openalex.org/W2033407366","https://openalex.org/W2039977878","https://openalex.org/W2040807747","https://openalex.org/W2055396755","https://openalex.org/W2059292849","https://openalex.org/W2063029497","https://openalex.org/W2070324762","https://openalex.org/W2078432227","https://openalex.org/W2083147990","https://openalex.org/W2086160027","https://openalex.org/W2106458801","https://openalex.org/W2107103878","https://openalex.org/W2109724541","https://openalex.org/W2117375083","https://openalex.org/W2164449382","https://openalex.org/W2164548001","https://openalex.org/W2262347362","https://openalex.org/W2318908254","https://openalex.org/W2324363623","https://openalex.org/W2325835442","https://openalex.org/W2328580899","https://openalex.org/W2534012541","https://openalex.org/W2587511748","https://openalex.org/W2741221732","https://openalex.org/W2911865844","https://openalex.org/W2962744611","https://openalex.org/W4255194959","https://openalex.org/W4301442799","https://openalex.org/W4388313855"],"related_works":[],"abstract_inverted_index":{"Linear":[0],"logical":[1],"frameworks":[2,58],"with":[3,128,148],"subexponentials":[4,27],"have":[5],"been":[6],"used":[7],"for":[8,35,109],"the":[9,36,39,45,82,91,98,116,122,125,129],"specification":[10],"of,":[11],"among":[12],"other":[13],"systems,":[14,16],"proof":[15,83,88],"concurrent":[17],"programming":[18],"languages":[19],"and":[20,41,65,131,141],"linear":[21,86,146],"authorisation":[22],"logics.":[23],"In":[24],"these":[25],"frameworks,":[26],"can":[28,48,59,96],"be":[29,50,61],"configured":[30],"to":[31,72],"allow":[32],"or":[33],"not":[34,69],"application":[37,99],"of":[38,67,77,85,100,118,124],"contraction":[40,133],"weakening":[42],"rules":[43],"while":[44],"exchange":[46,101,126],"rule":[47,102,127],"always":[49],"applied.":[51],"This":[52,79],"means":[53],"that":[54],"formulae":[55,68,74],"in":[56,90,115],"such":[57],"only":[60],"organised":[62],"as":[63,75],"sets":[64],"multisets":[66],"being":[70],"possible":[71],"organise":[73],"lists":[76],"formulae.":[78],"paper":[80],"investigates":[81],"theory":[84],"logic":[87,147],"systems":[89,95],"non-commutative":[92,119,145],"variant.":[93],"These":[94],"disallow":[97],"on":[103,144],"some":[104,138],"subexponentials.":[105,149],"We":[106,135],"investigate":[107],"conditions":[108],"when":[110],"cut":[111],"elimination":[112],"is":[113],"admissible":[114],"presence":[117],"subexponentials,":[120],"investigating":[121],"interaction":[123],"local":[130],"non-local":[132],"rules.":[134],"also":[136],"obtain":[137],"new":[139],"undecidability":[140],"decidability":[142],"results":[143]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-09-25T00:00:00"}