A Semantic Proof of Generalised Cut Elimination for Deep Inference

Multiplicative-Additive System Virtual (MAV) is a logic that extends Multiplicative-Additive Linear Logic with a self-dual non-commutative operator expressing the concept of "before" or "sequencing". MAV is also an extenson of the the logic Basic System Virtual (BV) with additive...

Full description

Saved in:
Bibliographic Details
Published in:Electronic Notes in Theoretical Informatics and Computer Science Vol. 4 - Proceedings of...
Main Authors: Atkey, Robert, Kokke, Wen
Format: Journal Article
Language:English
Published: 11.12.2024
ISSN:2969-2431, 2969-2431
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Multiplicative-Additive System Virtual (MAV) is a logic that extends Multiplicative-Additive Linear Logic with a self-dual non-commutative operator expressing the concept of "before" or "sequencing". MAV is also an extenson of the the logic Basic System Virtual (BV) with additives. Formulas in BV have an appealing reading as processes with parallel and sequential composition. MAV adds internal and external choice operators. BV and MAV are also closely related to Concurrent Kleene Algebras. Proof systems for MAV and BV are Deep Inference systems, which allow inference rules to be applied anywhere inside a structure. As with any proof system, a key question is whether proofs in MAV can be reduced to a normal form, removing detours and the introduction of structures not present in the original goal. In Sequent Calcluli systems, this property is referred to as Cut Elimination. Deep Inference systems have an analogous Cut rule and other rules that are not present in normalised proofs. Cut Elimination for Deep Inference systems has the same metatheoretic benefits as for Sequent Calculi systems, including consistency and decidability. Proofs of Cut Elimination for BV, MAV, and other Deep Inference systems present in the literature have relied on intrincate syntactic reasoning and complex termination measures. We present a concise semantic proof that all MAV proofs can be reduced to a normal form avoiding the Cut rule and other "non analytic" rules. We also develop soundness and completeness proofs of MAV (and BV) with respect to a class of models. We have mechanised all our proofs in the Agda proof assistant, which provides both assurance of their correctness as well as yielding an executable normalisation procedure.- Our technique extends to include exponentials and the additive units.
AbstractList Multiplicative-Additive System Virtual (MAV) is a logic that extends Multiplicative-Additive Linear Logic with a self-dual non-commutative operator expressing the concept of "before" or "sequencing". MAV is also an extenson of the the logic Basic System Virtual (BV) with additives. Formulas in BV have an appealing reading as processes with parallel and sequential composition. MAV adds internal and external choice operators. BV and MAV are also closely related to Concurrent Kleene Algebras. Proof systems for MAV and BV are Deep Inference systems, which allow inference rules to be applied anywhere inside a structure. As with any proof system, a key question is whether proofs in MAV can be reduced to a normal form, removing detours and the introduction of structures not present in the original goal. In Sequent Calcluli systems, this property is referred to as Cut Elimination. Deep Inference systems have an analogous Cut rule and other rules that are not present in normalised proofs. Cut Elimination for Deep Inference systems has the same metatheoretic benefits as for Sequent Calculi systems, including consistency and decidability. Proofs of Cut Elimination for BV, MAV, and other Deep Inference systems present in the literature have relied on intrincate syntactic reasoning and complex termination measures. We present a concise semantic proof that all MAV proofs can be reduced to a normal form avoiding the Cut rule and other "non analytic" rules. We also develop soundness and completeness proofs of MAV (and BV) with respect to a class of models. We have mechanised all our proofs in the Agda proof assistant, which provides both assurance of their correctness as well as yielding an executable normalisation procedure.- Our technique extends to include exponentials and the additive units.
Author Kokke, Wen
Atkey, Robert
Author_xml – sequence: 1
  givenname: Robert
  surname: Atkey
  fullname: Atkey, Robert
– sequence: 2
  givenname: Wen
  surname: Kokke
  fullname: Kokke, Wen
BookMark eNpNkMFKAzEURYNUsNYu3ecHpublTSYzyzrWWigo2P2QybxAYCYpSV3492rronDh3s25i3PPZiEGYuwRxKqsZFM_UTh5m1dQ1lrcsLlsqqaQJcLsat-xZc6-FwpErVSj5-x5zT9pMn8s_0gxOv6bLQVKZvSZBt5-nfhm9JMP5uRj4C4m_kJ05LvgKFGw9MBunRkzLf97wQ6vm0P7Vuzft7t2vS-s1qKoBpRYOqckOdtLKUD0ihoNiJKqHg0oAsAeCUnXQqAZpFEAytZgQTpcsOJya1PMOZHrjslPJn13ILqzgu6ioDsrwB_fYVCy
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.46298/entics.14870
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
EISSN 2969-2431
ExternalDocumentID 10_46298_entics_14870
GroupedDBID AAFWJ
AAYXX
ADQAK
CITATION
M~E
ID FETCH-LOGICAL-c770-6d3234ff52efcb22010b5e971332e6b3a15e113b3e3e78003ad2a5115c81c12f3
ISSN 2969-2431
IngestDate Wed Oct 29 21:22:19 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c770-6d3234ff52efcb22010b5e971332e6b3a15e113b3e3e78003ad2a5115c81c12f3
OpenAccessLink https://entics.episciences.org/14870/pdf
ParticipantIDs crossref_primary_10_46298_entics_14870
PublicationCentury 2000
PublicationDate 2024-12-11
PublicationDateYYYYMMDD 2024-12-11
PublicationDate_xml – month: 12
  year: 2024
  text: 2024-12-11
  day: 11
PublicationDecade 2020
PublicationTitle Electronic Notes in Theoretical Informatics and Computer Science
PublicationYear 2024
SSID ssib051085597
Score 2.276654
Snippet Multiplicative-Additive System Virtual (MAV) is a logic that extends Multiplicative-Additive Linear Logic with a self-dual non-commutative operator expressing...
SourceID crossref
SourceType Index Database
Title A Semantic Proof of Generalised Cut Elimination for Deep Inference
Volume 4 - Proceedings of...
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2969-2431
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib051085597
  issn: 2969-2431
  databaseCode: M~E
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PS8MwFA7zx8GLKCr-JgfxIp1L0jTNcerEi8PDQG8zaVMY025sVTz5t_uSpl2VHfQglFJCG9J-7df3ku-9h9CZXUtSHD5AFcY6CIXgge4wHUglOx2VgkOWpa7YhOj346cn-dBqPVexMO8vIs_jjw85_VeooQ3AtqGzf4C77hQa4BhAhz3ADvtfAd-F7_8VnpfVvINZnFlz0CeXHs3tfO5bYcVcVgJT6wxvjJkCVfjYv2-z9YsyOf1J4dRbZTy_D3704Ux1sueqSkRFGvULVYz9CpWTctc8PxmX6qBHH5LmJyCoS3PoCdLxFJWRXaTxZG6WtHmiDS-CMvzB_ZatUqXdbi-j8TCiMnbg2dEDmcdlcZHv6bJ__MZqcSG4Na6DYXn50F2-gtao4NKK_u4_exXjcBt7wV0FnnrEZSJW18NlcwANw6VhgQy20KZ3HXC3hHwbtUy-g666uIIbO7gxbA24McCNG3BjgAtbuHEN9y4a3PYG13eBr4sRJEKAs58yysIs49RkiaZWzqC5kXa2gZpIM0W4IYRpZpgR4A8wlVIFdjVPYpIQmrE9tJpPcrOPcKSpAYeb6IhkoSSZUsDHykQ0IULHaXiAzqt7Hk7L7CfDpY_38LcnHqGNxTt0jFaL2Zs5QevJezGaz04dOF_VSVJd
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Semantic+Proof+of+Generalised+Cut+Elimination+for+Deep+Inference&rft.jtitle=Electronic+Notes+in+Theoretical+Informatics+and+Computer+Science&rft.au=Atkey%2C+Robert&rft.au=Kokke%2C+Wen&rft.date=2024-12-11&rft.issn=2969-2431&rft.eissn=2969-2431&rft.volume=4+-+Proceedings+of...&rft_id=info:doi/10.46298%2Fentics.14870&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_entics_14870
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2969-2431&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2969-2431&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2969-2431&client=summon