Vincent Danos, Jean-Baptiste Joinet, and Harold Schellinx. Computational isomorphisms in classical logic (extended abstract). In Jean-Yves Girard, Mitsu Okada, and Andr'e Scedrov, editors, Proceedings Linear Logic '96 Tokyo Meeting, volume 3 of Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam, 1996. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Polarized Proof-Nets: Proof-Nets for LC (Extended Abstract) - Laurent (Correct)
....rules on non atomic negative formulas which are not translated by G formulas in LL. A solution is to add the constraints of LC rev to LC as we have done, but another one is to introduce cuts for the translation of these rules. This has been done with linear isomorphisms in Danos JoinetSchellinx [1]. 3.2 LLPc LC rev Definition 6. The translation G 7 G from LLP c into LC rev is defined on strictly polarized formulas by: A) A ( N ) N 1 = V 0 = F (P Omega Q) P Q (P Phi Q) P Q (P Omega N ) P N ( N Omega P) N P (9xP) 9xP (9x N ) 9xN (P ....
Vincent Danos, Jean-Baptiste Joinet, and Harold Schellinx. Computational isomorphisms in classical logic (extended abstract). In Jean-Yves Girard, Mitsu Okada, and Andr'e Scedrov, editors, Proceedings Linear Logic '96 Tokyo Meeting, volume 3 of Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC