Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Modularity of proof-nets

Modularity of proof-nets 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Loading next page...
 
/lp/springer-journals/modularity-of-proof-nets-Awi0hrHWLG

References (8)

Publisher
Springer Journals
Copyright
Copyright © 2004 by Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Mathematics, general; Algebra; Mathematical Logic and Foundations
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s00153-004-0242-2
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Archive for Mathematical LogicSpringer Journals

Published: May 25, 2004

There are no references for this article.