8 search results - page 2 / 2 » Cut Elimination for Monomial MALL Proof Nets |
TLCA
2009
Springer
14 years 13 hour ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
LICS
1990
IEEE
13 years 9 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
CSL
2005
Springer
13 years 11 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...