Complexity of correctness for pomset logic proof nets

12/23/2019
by   Lê Thành Dũng Nguyên, et al.
0

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

READ FULL TEXT VIEW PDF

page 1

page 2

page 3

page 4

12/23/2019

Proof nets through the lens of graph theory: a compilation of remarks

This document is intended to eventually gather a few small remarks on th...
02/13/2020

The Abstract Machinery of Interaction (Long Version)

This paper revisits the Interaction Abstract Machine (IAM), a machine ba...
01/29/2019

Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix

This paper establishes a bridge between linear logic and mainstream grap...
09/13/2019

Reasoning about call-by-value: a missing result in the history of Hoare's logic

We provide a sound and relatively complete Hoare-like proof system for r...
05/13/2021

Verification of the Incremental Merkle Tree Algorithm with Dafny

The Deposit Smart Contract (DSC) is an instrumental component of the Eth...
02/26/2019

A New Linear Time Correctness Condition for Multiplicative Linear Logic

In this paper, we give a new linear time correctness condition for proof...
01/28/2020

First-Order Logic for Flow-Limited Authorization

We present the Flow-Limited Authorization First-Order Logic (FLAFOL), a ...

References

  • [GLMM13] Laurent Gourvès, Adria Lyra, Carlos A. Martinhon, and Jérôme Monnot. Complexity of trails, paths and circuits in arc-colored digraphs. Discrete Applied Mathematics, 161(6):819–828, April 2013.
  • [Ngu18] Lê Thành Dũng Nguyên. Unique perfect matchings and proof nets. In Hélène Kirchner, editor, 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), volume 108 of Leibniz International Proceedings in Informatics (LIPIcs), pages 25:1–25:20, Dagstuhl, Germany, 2018. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
  • [Ngu20] Lê Thành Dũng Nguyên. Constrained path-finding and structure from acyclicity. CoRR, abs/1901.07028, 2020.
  • [Ret97] Christian Retoré. Pomset logic: A non-commutative extension of classical linear logic. In Gerhard Goos, Juris Hartmanis, Jan Leeuwen, Philippe Groote, and J. Roger Hindley, editors, Typed Lambda Calculi and Applications, volume 1210, pages 300–318. Springer Berlin Heidelberg, Berlin, Heidelberg, 1997.
  • [Ret03] Christian Retoré. Handsome proof-nets: perfect matchings and cographs. Theoretical Computer Science, 294(3):473–488, February 2003.