Acyclicity and coherence in multiplicative exponential linear logic

Authors:
Michele Pagani
Affiliations:
Dipartimento di Filosofia, Università Roma Tre, Roma
Venue:
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Year:
2006

Citing 3
Cited 3

Linear logic

Theoretical Computer Science
A semantic characterisation of the correctness of a proof net

Mathematical Structures in Computer Science
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic

Mathematical Structures in Computer Science

A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The Cut-Elimination Theorem for Differential Nets with Promotion

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Non-uniform (hyper/multi)coherence spaces

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a geometric condition that characterizes MELL proof structures whose interpretation is a clique in non-uniform coherent spaces: visible acyclicity. We define the visible paths and we prove that the proof structures which have no visible cycles are exactly those whose interpretation is a clique. It turns out that visible acyclicity has also nice computational properties, especially it is stable under cut reduction.