Bounded contraction and Gentzen-style formulation of Łukasiewicz logics

DOI10.1007/BF00370844zbMath0865.03015OpenAlexW2001730565MaRDI QIDQ2563461

Andreja Prijatelj

Publication date: 1 July 1997

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00370844

zbMATH Keywords

finite modelsmany-valued logicaxiomatizationcontraction ruleGentzen calculusŁukasiewicz logicsfragments of linear logicinfinite linear models

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items

An implication based study on Łukasiewicz (Monteiro) 3-valued algebra and pre-rough algebra, Free algebras corresponding to multiplicative classical linear logic and some of its extensions, Labelled Calculi for Łukasiewicz Logics, From cut-free calculi to automated deduction: the case of bounded contraction, Free ordered algebraic structures towards proof theory, Uninorm logic with the \(n\)-potency axiom, Towards an algorithmic construction of cut-elimination procedures, Linear Logic and Lukasiewicz ℵ₀- Valued Logic: A Logico-Algebraic Study, Giles's game and the proof theory of Łukasiewicz logic, Double-negation elimination in some propositional logics, Towards a semantic characterization of cut-elimination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• An axiomatization of the finite-valued Łukasiewicz calculus
• A method of axiomatization of Lukasiewicz logics
• Extensions of the \(\aleph_ 0\)-valued Łukasiewicz propositional logic
• Algebraic Analysis of Many Valued Logics
• A New Proof of the Completeness of the Lukasiewicz Axioms
• Natural 3-valued logics—characterization and proof theory
• A note on the deductive completeness of m-valued propositional calculi
• Axiom schemes for m-valued propositions calculi