Proof nets are defined for PiL with a correctness criterion, sequentialization procedure, and translation algorithm, establishing a canonical representation of sequent calculus derivations modulo rule permutations.
Theoreti- cal Computer Science294(3), 473–488 (2003)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Proof Nets for PiL (Full Version)
Proof nets are defined for PiL with a correctness criterion, sequentialization procedure, and translation algorithm, establishing a canonical representation of sequent calculus derivations modulo rule permutations.