|
14
|
Don’t eliminate cut
– George Boolos
- 1984
|
|
3
|
Identity of proofs based on normalization and generality
– Kosta Doˇsen
|
|
2
|
A Non-commutative Extension of Multiplicative Exponential Linear Logic
– Alessio Guglielmi, Lutz Straßburger
- 2004
|
|
14
|
Correctness of Multiplicative Proof Nets is Linear
– Stefano Guerrini
- 1999
|
|
1
|
Deep inderence proof theory equals categorical proof theory minus coherence
– Dominic Hughes
- 2004
|
|
1
|
Une preuve combinatoire de forte normalisation (du fragment multiplicatif et exponentiel) des réseaux de preuves pour la logique linéaire (PN1
– Jean-Baptiste Joinet
- 1992
|
|
3
|
Completeness of MLL proof nets w.r.t. weak distributivity
– J-B Joinet
- 2006
|
|
2
|
semantics for full propositional linear logic
– Games
- 1995
|
|
4
|
Classical Categories and Deep Inference
– Richard McKinley
- 2005
|
|
4
|
Handsome proof-nets: R&B-graphs, perfect matchings and series-parallel graphs. Rapport de recherche 3652
– Christian Retoré
- 1999
|
|
21
|
Abrusci and Paul Ruet. Non-commutative logic I: The multiplicative fragment
– Vito Michele
|
|
5
|
From Deep Inference to Proof Nets
– Lutz Straßburger
- 2005
|
|
31
|
Pomset Logic: A Non-Commutative Extension of Classical Linear Logic
– Christian Retoré
- 1997
|
|
21
|
Full completeness of the multiplicative linear logic of chu spaces
– Harish Devarajan, Dominic Hughes, Gordon Plotkin, Vaughan Pratt
- 1999
|
|
20
|
Réseaux et Séquents Ordonnés. Thèse de Doctorat, spécialité Mathématiques, Université Paris 7, février
– Christian Retoré
- 1993
|
|
10
|
Pomset logic as a calculus of directed cographs
– Christian Retoré
- 1999
|
|
42
|
Classical Logic, Continuation Semantics and Abstract Machines
– Thomas Streicher, Fachbereich Mathematik, B. Reus
- 1998
|
|
29
|
Refutations by matings
– P B Andrews
- 1976
|
|
11
|
de Wiele. Subnets of proof-nets in MLL
– G Bellin, J van
- 1995
|
