Correctness of linear logic proof structures is NL-complete

12 years 11 months ago

Download hal.archives-ouvertes.fr

We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a linear logic proof structure is NL-complete.

Paulin Jacobé de Naurois, Virgile Mogbil

Real-time Traffic

Correctness | Linear Logic | Linear Logic Proof | TCS 2011 | Theoretical Computer Science |

claim paper

» A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear...

» Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic

» Correctness of Multiplicative Additive Proof Structures is NLComplete

» Strong normalization property for second order linear logic

» Proofs denotational semantics and observational equivalences in Multiplicative Linear Logi...

» Specifying Proof Systems in Linear Logic with Subexponentials

» Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

» Focused Proof Search for Linear Logic in the Calculus of Structures

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TCS
Authors	Paulin Jacobé de Naurois, Virgile Mogbil

Comments (0)

Sciweavers

Correctness of linear logic proof structures is NL-complete

Correctness | Linear Logic | Linear Logic Proof | TCS 2011 | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers