A New Correctness Criterion For The Proof Nets Of Non-commutative Multiplicative Linear Logics

&
Journal of Symbolic Logic 66 (4):1524-1542 (2001)
  Copy   BIBTEX

Abstract

This paper presents a new correctness criterion for marked Danos-Reginer graphs of Multiplicative Cyclic Linear Logic MCLL and Abrusci's non-commutative Linear Logic MNLL. As a corollary we obtain an affirmative answer to the open question whether a known quadratic-time algorithm for the correctness checking of proof nets for MCLL and MNLL can be improved to linear-time.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A new correctness criterion for the proof nets of non-commutative multiplicative linear logics.Misao Nagayama & Mitsuhiro Okada - 2001 - Journal of Symbolic Logic 66 (4):1524-1542.
A new correctness criterion for multiplicative non-commutative proof nets.Roberto Maieli - 2003 - Archive for Mathematical Logic 42 (3):205-220.
A new correctness criterion for cyclic proof nets.V. Michele Abrusci & Elena Maringelli - 1998 - Journal of Logic, Language and Information 7 (4):449-459.
Planar and braided proof-nets for multiplicative linear logic with mix.G. Bellin & A. Fleury - 1998 - Archive for Mathematical Logic 37 (5-6):309-325.
Non-commutative logic I: the multiplicative fragment.V. Michele Abrusci & Paul Ruet - 1999 - Annals of Pure and Applied Logic 101 (1):29-64.
Homology of proof-nets.François Métayer - 1994 - Archive for Mathematical Logic 33 (3):169-188.
Softness of MALL proof-structures and a correctness criterion with Mix.Masahiro Hamano - 2004 - Archive for Mathematical Logic 43 (6):751-794.
Completeness of MLL Proof-Nets w.r.t. Weak Distributivity.Jean-Baptiste Joinet - 2007 - Journal of Symbolic Logic 72 (1):159 - 170.
Proof nets sequentialisation in multiplicative linear logic.Paolo Di Giamberardino & Claudia Faggian - 2008 - Annals of Pure and Applied Logic 155 (3):173-182.
Modularity of proof-nets.Roberto Maieli & Quintijn Puite - 2005 - Archive for Mathematical Logic 44 (2):167-193.
Proof nets for the multimodal Lambek calculus.Richard Moot & Quintijn Puite - 2002 - Studia Logica 71 (3):415-442.
Interpolation in fragments of classical linear logic.Dirk Roorda - 1994 - Journal of Symbolic Logic 59 (2):419-444.
Coherence in linear predicate logic.Kosta Došen & Zoran Petrić - 2009 - Annals of Pure and Applied Logic 158 (1-2):125-153.
The additive multiboxes.Lorenzo Tortora de Falco - 2003 - Annals of Pure and Applied Logic 120 (1-3):65-102.
A topological correctness criterion for non-commutative logic.Paul-André Mellies - 2004 - In Thomas Ehrhard (ed.), Linear Logic in Computer Science. Cambridge University Press. pp. 283--323.

Analytics

Added to PP
2017-02-21

Downloads
11 (#1,136,567)

6 months
1 (#1,469,946)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references