Bounded contraction in systems with linearity

DOI10.1007/3-540-48754-9_13MaRDI QIDQ4263010zbMATH OpenFDO

Authors Agata Ciabattoni

Publication date 28 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48754-9_13

zbMATH Keywords

\(n\)-contraction law\(n\)-weak law of excluded middleaffine intuitionistic linear logicaxiomatizationcut-eliminationcut-free hypersequent calculifinite-valued Gödel logicfinite-valued Łukasiewicz logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Bounded contraction and Gentzen-style formulation of Łukasiewicz logics
• Connectification for n-contraction
• Bounded Łukasiewicz logics
• Hypersequent calculi for some intermediate logics with bounded Kripke models
• Logics without the contraction rule

Cited in

(7)

• Linear dynamical system: compactness theorem
• Connectification for n-contraction
• Bounded contraction and Gentzen-style formulation of Łukasiewicz logics
• Contractive Systems with Inputs
• Bounded Łukasiewicz logics
• Uninorm logic with the \(n\)-potency axiom
• Non-falsity and general threshold-preserving companions of MTL logics

This page was built for publication: Bounded contraction in systems with linearity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263010)