English

Intuitionistic BV (Extended version)

Logic in Computer Science 2026-04-27 v2

Abstract

We present the logic IBV, which is an intuitionistic version of BV, in the sense that its restriction to the MLL connectives is exactly IMLL, the intuitionistic version of MLL. For this logic we give a deep inference proof system and show cut elimination. We also show that the logic obtained from IBV by dropping the associativity of the new non-commutative seq-connective is an intuitionistic variant of the recently introduced logic NML. For this logic, called INML, we give a cut-free sequent calculus.

Keywords

Cite

@article{arxiv.2505.13284,
  title  = {Intuitionistic BV (Extended version)},
  author = {Matteo Acclavio and Lutz Strassburger},
  journal= {arXiv preprint arXiv:2505.13284},
  year   = {2026}
}
R2 v1 2026-07-01T02:22:17.598Z