A semantic characterisation of the correctness of a proof net
From MaRDI portal
Publication:4366767
DOI10.1017/S096012959700234XzbMath0883.03041OpenAlexW2051314992MaRDI QIDQ4366767
Publication date: 23 March 1998
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096012959700234x
Related Items (8)
Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing ⋮ Visible acyclic differential nets. I: Semantics ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ The relational model is injective for multiplicative exponential linear logic (without weakenings) ⋮ A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic ⋮ Unnamed Item ⋮ Non decomposable connectives of linear logic ⋮ Pomset Logic
This page was built for publication: A semantic characterisation of the correctness of a proof net