Theoretical Computer Science
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Linear logic: its syntax and semantics
Proceedings of the workshop on Advances in linear logic
The undecidability of second order multiplicative linear logic
Information and Computation
Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
Theoretical Computer Science - Special issue on linear logic, 1
Theoretical Computer Science
Hi-index | 0.00 |
We study the relationship between classical phase semantics for classical linear logic (LL) and intuitionistic phase semantics for intuitionistic linear logic (ILL). We prove that (i) every intuitionistic phase space is a subspace of a classical phase space, and (ii) every intuitionistic phase space is phase isomorphic to an ‘almost classical’ phase space. Here, by an ‘almost classical’ phase space we mean an intuitionistic phase space having a double-negation-like closure operator. Based on these semantic considerations, we give a syntactic embedding of propositional ILL into LL.