Sciweavers

234 search results - page 3 / 47
» Proof Nets and the Identity of Proofs
Sort
View
CORR
2008
Springer
121views Education» more  CORR 2008»
14 years 10 months ago
Graph Algorithms for Improving Type-Logical Proof Search
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Richard Moot
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 10 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
LICS
2008
IEEE
15 years 4 months ago
Cut Elimination for Monomial MALL Proof Nets
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
Olivier Laurent, Roberto Maieli
COLING
1992
14 years 11 months ago
Proof-Nets And Dependencies
Proof-Nets (Roorda 1990) are a good device for processing with categorial grammars, mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readab...
Alain Lecomte
CIE
2010
Springer
15 years 2 months ago
What Is the Problem with Proof Nets for Classical Logic?
This paper is an informal (and nonexhaustive) overview over some existing notions of proof nets for classical logic, and gives some hints why they might be considered to be unsatis...
Lutz Straßburger