@inproceedings{2be3cf46005d454ba09ab1c559339ed4,
title = "BV and Pomset Logic Are Not the Same",
abstract = "BV and pomset logic are two logics that both conservatively extend unit-free multiplicative linear logic by a third binary connective, which (i) is non-commutative, (ii) is self-dual, and (iii) lies between the {\textquotedblleft}par{\textquotedblright} and the {\textquotedblleft}tensor{\textquotedblright}. It was conjectured early on (more than 20 years ago), that these two logics, that share the same language, that both admit cut elimination, and whose connectives have essentially the same properties, are in fact the same. In this paper we show that this is not the case. We present a formula that is provable in pomset logic but not in BV.",
keywords = "Cographs, Deep inference, Dicographs, Pomset logic, Proof nets, Series-parallel orders, System BV",
author = "Nguy{\^e}n, \{L{\^e} Th{\`a}nh Dũng\} and Lutz Stra{\ss}burger",
note = "Publisher Copyright: {\textcopyright} L{\^e} Th{\`a}nh Dũng Nguy\textasciitilde{}{\^e}n and Lutz Stra{\ss}burger.; 30th EACSL Annual Conference on Computer Science Logic, CSL 2022 ; Conference date: 14-02-2022 Through 19-02-2022",
year = "2022",
month = feb,
day = "1",
doi = "10.4230/LIPIcs.CSL.2022.32",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Florin Manea and Alex Simpson",
booktitle = "30th EACSL Annual Conference on Computer Science Logic, CSL 2022",
}