Proof nets of PN as graphs

&
Archive for Mathematical Logic 34 (1):1-20 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/bf01269873

Links

PhilArchive



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

External links

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

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.
A new correctness criterion for cyclic proof nets.V. Michele Abrusci & Elena Maringelli - 1998 - Journal of Logic, Language and Information 7 (4):449-459.
Interpolation in fragments of classical linear logic.Dirk Roorda - 1994 - Journal of Symbolic Logic 59 (2):419-444.
Completeness of MLL Proof-Nets w.r.t. Weak Distributivity.Jean-Baptiste Joinet - 2007 - Journal of Symbolic Logic 72 (1):159 - 170.
On the Jordan-Hölder decomposition of proof nets.Quintijn Puite & Harold Schellinx - 1997 - Archive for Mathematical Logic 37 (1):59-65.
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.
Homology of proof-nets.François Métayer - 1994 - Archive for Mathematical Logic 33 (3):169-188.
A new correctness criterion for multiplicative non-commutative proof nets.Roberto Maieli - 2003 - Archive for Mathematical Logic 42 (3):205-220.
Proof nets and the complexity of processing center embedded constructions.Mark Johnson - 1998 - Journal of Logic, Language and Information 7 (4):433-447.
Bayesian Nets Are All There Is To Causal Dependence.Wolfgang Spohn - unknown
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Proof nets for the multimodal Lambek calculus.Richard Moot & Quintijn Puite - 2002 - Studia Logica 71 (3):415-442.
The cost of a cycle is a square.A. Carbone - 2002 - Journal of Symbolic Logic 67 (1):35-60.

Analytics

Added to PP
2013-11-23

Downloads
23 (#678,765)

6 months
4 (#776,943)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references