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

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

This document is intended to eventually gather a few small remarks on the theory of proof nets and correctness criteria that I have never published. For now the only written part is about Retoré's pomset logic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2019

Complexity of correctness for pomset logic proof nets

We show that it is coNP-complete to decide whether a given proof structu...
research
02/13/2020

The Abstract Machinery of Interaction (Long Version)

This paper revisits the Interaction Abstract Machine (IAM), a machine ba...
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...
research
02/10/2021

Interpreting a concurrent λ-calculus in differential proof nets (extended version)

In this paper, we show how to interpret a language featuring concurrency...
research
09/26/2020

Neural Proof Nets

Linear logic and the linear λ-calculus have a long standing tradition in...
research
04/04/2023

Implementing Dynamic Programming in Computability Logic Web

We present a novel definition of an algorithm and its corresponding algo...
research
07/27/2020

Unfolding cubes: nets, packings, partitions, chords

We show that every ridge unfolding of an n-cube is without self-overlap,...

Please sign up or login with your details

Forgot password? Click here to reset