Formulas for which contraction is admissible

Logic Journal of the IGPL 6 (1):43-48 (1998)
A formula A is said to have the contraction property in a logic L if whenever A, A, Γ ⊨ L B also A, Γ & ; L B. In MLL and in MALL without the additive constants a formula has the contraction property if it is a theorem. Adding the mix rule does not change this fact. In MALL and in affine logic A has the contraction property if either A is provable of A is equivalent to the additive constant 0. We present some general proof-theoretical principles from which all these results easily follow
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/jigpal/6.1.43
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,201
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Shawn Standefer (2016). Contraction and Revision. Australasian Journal of Logic 13 (3):58-77.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

4 ( #626,606 of 1,940,983 )

Recent downloads (6 months)

1 ( #457,978 of 1,940,983 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.