A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic

Authors:
Paolo Tranquilli
Affiliations:
Dipartimento di Matematica, Università Roma Tre, Roma, Italy 00146 and Laboratoire PPS, Université Paris Diderot, Paris 7, Paris, France 75205
Venue:
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Year:
2008

Citing 7
Cited 0

Linear logic

Theoretical Computer Science
Hypercoherences: a strongly stable model of linear logic

Proceedings of the workshop on Advances in linear logic
Concurrent Games and Full Completeness

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A semantic characterisation of the correctness of a proof net

Mathematical Structures in Computer Science
A stable programming language

Information and Computation
Acyclicity and coherence in multiplicative exponential linear logic

CSL'06 Proceedings of the 20th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hyperclique in Ehrhard's hypercoherent spaces. This criterion is strictly weaker than the one given by Hughes and van Glabbeek characterizing proof nets (i.e. desequentialized sequent calculus proofs). We thus also give the first proof of semantical soundness of hypercoherent spaces with respect to proof nets entirely based on graph theoretical trips, in the style of Girard's proof of semantical soundness of coherent spaces for proof nets of the multiplicative fragment of linear logic.