Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-10T13:01:36.454Z Has data issue: false hasContentIssue false
  • English
  • Français

Exchange rules

Published online by Cambridge University Press:  12 March 2014

Mario Piazza
Mario Piazza*
Affiliation:
Department of Philosophy, University of Chieti, Campus Universitario - Via Pescara - 66013 Chieti, Italy, E-mail: m.piazza@unich.it
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we show by a proof-theoretical argument that in a logic without structural rules, that is in noncommutative linear logic with exponentials, every formula A for which exchange rules (and weakening and contraction as well) are admissible is provably equivalent to? A. This property shows that the expressive power of “noncommutative exponentials” is much more important than that of “commutative exponentials”.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 66 , Issue 2 , June 2001 , pp. 509 - 516
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Abrusci, V. M., Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic, this Journal, vol. 56 (1991), pp. 1403–1451.Google Scholar
[2]Castellan, M. and Piazza, M., Saturated Formulas in Full Linear Logic, Journal of Logic and Computation, vol. 8 (1998), pp. 665–668.CrossRefGoogle Scholar
[3]Lincoln, P., Mitchell, J., Scedrov, A., and Shankar, N., Decision Problems for Propositional Linear Logic, Annals of Pure and Applied Logic, vol, 56 (1992), pp. 239–311.CrossRefGoogle Scholar
[4]Yetter, D. N., Quantales and (noncommutative) linear logic, this Journal, vol. 55 (1990), pp. 41–64.Google Scholar