AI Chat AI Image Generator AI Video Text to Speech

Complexity of correctness for pomset logic proof nets

12/23/2019

∙

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

∙

∙

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

page 1

page 2

page 3

page 4

research

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

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

research

∙ 02/13/2020

The Abstract Machinery of Interaction (Long Version)

This paper revisits the Interaction Abstract Machine (IAM), a machine ba...

0 Beniamino Accattoli, et al. ∙

research

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

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

research

∙ 05/13/2021

Verification of the Incremental Merkle Tree Algorithm with Dafny

The Deposit Smart Contract (DSC) is an instrumental component of the Eth...

0 Franck Cassez, et al. ∙

research

∙ 11/08/2022

Perspectives on neural proof nets

In this paper I will present a novel way of combining proof net proof se...

0 Richard Moot, et al. ∙

research

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

0 Krzysztof R. Apt, et al. ∙

research

∙ 01/28/2020

First-Order Logic for Flow-Limited Authorization

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

0 Andrew K. Hirsch, et al. ∙