Complexity of correctness for pomset logic proof nets

12/23/2019

∙

by   Lê Thành Dũng Nguyên, et al.

∙

0

∙

share

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).