Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic-Reference-Cited by-同舟云学术

Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic

Published:1998 Issue: Volume:17 Page:1-20
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Galmiche D.,Martin B.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic;Abrusci;Journal of Symbolic Logic,1991

2. Noncommutative proof nets;Abrusci,1995

3. V.M. Abrusci. Lambek calculus, cyclic multiplicative-additive linear logic, noncommutative multiplicative-additive linear logic: language and sequent calculus. In V.M. Abrusci and C. Casadio, editors, Proofs and Linguistic Categories – Proceedings 1996 Roma Workshop, pages 21–48, 1996.

4. A. Asperti and G. Dore. Yet another correctness criterion for multiplicative linear logic with mix. In Logic at St Petersburg '94, Symposium on Logical Foundations of Computer Science, LNCS 813, pages 34–46, St Petersburg, Russia, July 1994.

5. Subnets of proof-nets in MLL−;Bellin,1995

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LINK: A Proof Environment Based on Proof Nets;Lecture Notes in Computer Science;2002

2. Proof-search in type-theoretic languages: an introduction;Theoretical Computer Science;2000-02

3. Proof-search and Proof Nets in Mixed Linear Logic;Electronic Notes in Theoretical Computer Science;2000