Bounded contraction and Gentzen-style formulation of Łukasiewicz logics
From MaRDI portal
Publication:2563461
DOI10.1007/BF00370844zbMath0865.03015MaRDI QIDQ2563461
Publication date: 1 July 1997
Published in: Studia Logica (Search for Journal in Brave)
finite models; many-valued logic; axiomatization; contraction rule; Gentzen calculus; Łukasiewicz logics; fragments of linear logic; infinite linear models
03B50: Many-valued logic
Related Items
Linear Logic and Lukasiewicz ℵ0- Valued Logic: A Logico-Algebraic Study, Towards an algorithmic construction of cut-elimination procedures, Double-negation elimination in some propositional logics, Towards a semantic characterization of cut-elimination, Giles's game and the proof theory of Łukasiewicz logic, Free algebras corresponding to multiplicative classical linear logic and some of its extensions, Free ordered algebraic structures towards proof theory, Labelled Calculi for Łukasiewicz Logics
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