Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. J.R., Cockett, G. R.A., Seelyb (1997)
Weakly distributive categoriesJournal of Pure and Applied Algebra, 114
S. Abramsky, R. Jagadeesan (1992)
Games and full completeness for multiplicative linear logicJournal of Symbolic Logic, 59
J. Andreoli (1992)
Logic Programming with Focusing Proofs in Linear LogicJ. Log. Comput., 2
V. Danos, L. Regnier (1989)
The structure of multiplicativesArchive for Mathematical Logic, 28
Michele Abrusci, P. Ruet (1999)
Non-Commutative Logic I: The Multiplicative FragmentAnn. Pure Appl. Log., 101
J. Girard (1987)
Linear LogicTheor. Comput. Sci., 50
J. Andreoli (2001)
Focussing and proof constructionAnn. Pure Appl. Log., 107
M. Nivat (1988)
Fiftieth volume of theoretical computer scienceTheoretical Computer Science, 50
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border induced by Danos-Regnier switchings. The type of a module is then defined as the double orthogonal of its pretype. This is an optimal notion describing the behaviour of a module: two modules behave in the same way precisely if they have the same type.
Archive for Mathematical Logic – Springer Journals
Published: May 25, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.