@inproceedings{3e75d4cbe7234e8c8e265a0fd889ea98,
title = "Canonical sequent proofs via multi-focusing",
abstract = "The sequent calculus admits many proofs of the same conclusion that differ only by trivial permutations of inference rules. In order to eliminate this {"}bureaucracy{"} from sequent proofs, deductive formalisms such as proof nets or natural deduction are usually used instead of the sequent calculus, for they identify proofs more abstractly and geometrically. In this paper we recover permutative canonicity directly in the cut-free sequent calculus by generalizing focused sequent proofs to admit multiple foci, and then considering the restricted class of maximally multi-focused proofs. We validate this definition by proving a bijection to the well-known proof-nets for the unit-free multiplicative linear logic, and discuss the possibility of a similar correspondence for larger fragments.",
author = "Kaustuv Chaudhuri and Dale Miller and Alexis Saurin",
year = "2008",
month = jan,
day = "1",
doi = "10.1007/978-0-387-09680-3\_26",
language = "English",
isbn = "9780387096797",
series = "IFIP International Federation for Information Processing",
publisher = "Springer New York",
pages = "383--396",
booktitle = "Fifth Ifip International Conference On Theoretical Computer Science - Tcs 2008",
}