Complexity of correctness for pomset logic proof nets
Logic in Computer Science
2023-01-24 v4
Abstract
We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).
Keywords
Cite
@article{arxiv.1912.10606,
title = {Complexity of correctness for pomset logic proof nets},
author = {Lê Thành Dũng Nguyên},
journal= {arXiv preprint arXiv:1912.10606},
year = {2023}
}
Comments
Fully subsumed by arXiv:2209.07825 (which contains a lot more material and has an additional coauthor)