Complexity of correctness for pomset logic proof nets
L\^e Th\`anh D\~ung Nguy\^en
TL;DR
This paper proves that determining the correctness of pomset logic proof nets is a coNP-complete problem, highlighting the computational complexity involved.
Contribution
It establishes the coNP-completeness of correctness decision for pomset logic proof nets using graph-theoretic methods.
Findings
Correctness checking is coNP-complete.
Graph-theoretic approach applied to proof net correctness.
Complexity classification for pomset logic proof nets.
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · Advanced Database Systems and Queries