Non-commutative logic I: the multiplicative fragment

Annals of Pure and Applied Logic 101 (1):29-64 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,682

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Non-commutative logic I: the multiplicative fragment.V. Michele Abrusci & Paul Ruet - 1999 - Annals of Pure and Applied Logic 101 (1):29-64.
The shuffle Hopf algebra and noncommutative full completeness.R. F. Blute & P. J. Scott - 1998 - Journal of Symbolic Logic 63 (4):1413-1436.
Syllogisms in Rudimentary Linear Logic, Diagrammatically.Ruggero Pagnan - 2013 - Journal of Logic, Language and Information 22 (1):71-113.
A new correctness criterion for cyclic proof nets.V. Michele Abrusci & Elena Maringelli - 1998 - Journal of Logic, Language and Information 7 (4):449-459.
Interpolation in fragments of classical linear logic.Dirk Roorda - 1994 - Journal of Symbolic Logic 59 (2):419-444.
The conjoinability relation in Lambek calculus and linear logic.Mati Pentus - 1994 - Journal of Logic, Language and Information 3 (2):121-140.
Natural deduction systems for some non-commutative logics.Norihiro Kamide & Motohiko Mouri - 2007 - Logic and Logical Philosophy 16 (2-3):105-146.
The logic of bunched implications.Peter W. O'Hearn & David J. Pym - 1999 - Bulletin of Symbolic Logic 5 (2):215-244.

Analytics

Added to PP
2014-03-20

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Dynamic negation and negative information.Sebastian Sequoiah-Grayson - 2009 - Review of Symbolic Logic 2 (1):233-248.
Modularity of proof-nets.Roberto Maieli & Quintijn Puite - 2005 - Archive for Mathematical Logic 44 (2):167-193.
A geometrical procedure for computing relaxation.Gabriele Pulcini - 2009 - Annals of Pure and Applied Logic 158 (1-2):80-89.

Add more citations

References found in this work

No references found.

Add more references