Bounded contraction and Gentzen-style formulation of łukasiewicz logics

Studia Logica 57 (2-3):437 - 456 (1996)
  Copy   BIBTEX

Abstract

In this paper, we consider multiplicative-additive fragments of affine propositional classical linear logic extended with n-contraction. To be specific, n-contraction (n 2) is a version of the contraction rule where (n+ 1) occurrences of a formula may be contracted to n occurrences. We show that expansions of the linear models for (n + 1)- valued ukasiewicz logic are models for the multiplicative-additive classical linear logic, its affine version and their extensions with n-contraction. We prove the finite axiomatizability for the classes of finite models, as well as for the class of infinite linear models based on the set of rational numbers in the interval [0, 1]. The axiomatizations obtained in a Gentzen-style formulation are equivalent to finite and infinite-valued ukasiewicz logics.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A survey of multiple contractions.André Fuhrmann & Sven Ove Hansson - 1994 - Journal of Logic, Language and Information 3 (1):39-75.
A cut-free Gentzen formulation of basic propositional calculus.Kentaro Kikuchi & Katsumi Sasaki - 2003 - Journal of Logic, Language and Information 12 (2):213-225.
How to be R eally Contraction-Free.Greg Restall - 1993 - Studia Logica 52 (3):381 - 391.
Finiteness in infinite-valued łukasiewicz logic.Stefano Aguzzoli & Agata Ciabattoni - 2000 - Journal of Logic, Language and Information 9 (1):5-29.
Expansion and contraction of finite states.Allard Tamminga - 2004 - Studia Logica 76 (3):427-442.
Connectification forn-contraction.Andreja Prijatelj - 1995 - Studia Logica 54 (2):149 - 171.

Analytics

Added to PP
2009-01-28

Downloads
33 (#416,771)

6 months
2 (#658,848)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
Natural 3-valued logics—characterization and proof theory.Arnon Avron - 1991 - Journal of Symbolic Logic 56 (1):276-294.
Many-Valued Logics.J. B. Rosser & A. R. Turquette - 1954 - British Journal for the Philosophy of Science 5 (17):80-83.
Lectures on Linear Logic.Anne Sjerp Troelstra - 1992 - Center for the Study of Language and Information Publications.
Axiom schemes for m-valued propositional calculi.J. B. Rosser & A. R. Turquette - 1945 - Journal of Symbolic Logic 10 (3):61-82.

View all 11 references / Add more references