A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
From MaRDI portal
Publication:3540183
DOI10.1007/978-3-540-87531-4_19zbMATH Open1156.03322OpenAlexW2166745846MaRDI QIDQ3540183FDOQ3540183
Authors: Paolo Tranquilli 
Publication date: 20 November 2008
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_19
Recommendations
Cites Work
- LCF considered as a programming language
- Asynchronous Games: Innocence Without Alternation
- Linear logic
- The structure of multiplicatives
- A stable programming language
- Acyclicity and Coherence in Multiplicative Exponential Linear Logic
- A semantic characterisation of the correctness of a proof net
- Title not available (Why is that?)
- Softness of hypercoherences and MALL full completeness
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- Visible acyclic differential nets. I: Semantics
- Softness of MALL proof-structures and a correctness criterion with Mix
- Title not available (Why is that?)
- Softness of hypercoherences and MALL full completeness
- Title not available (Why is that?)
- Non-uniform (hyper/multi)coherence spaces
- Title not available (Why is that?)
- Acyclicity and Coherence in Multiplicative Exponential Linear Logic
- On phase semantics and denotational semantics in multiplicative-additive linear logic
- Coherent interaction graphs
- Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract)
This page was built for publication: A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540183)
