Gentzenization and decidability of some contraction-less relevant logics

DOI10.1007/BF00454743zbMath0725.03007MaRDI QIDQ2277247

Ross T. Brady

Publication date: 1991

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

zbMATH Keywords

decision proceduresrelevant logicsDWTWGentzenizationcut-free Gentzen systems

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (12)

Temporal BI: proof system, semantics and translations ⋮ Paraconsistent constructive logic with strong negation as a contraction-free relevant logic ⋮ Relational proof system for relevant logics ⋮ Gentzenizations of relevant logics without distribution. I ⋮ Gentzenizations of relevant logics with distribution ⋮ Algebraic Kripke-style semantics for relevance logics ⋮ Distributive full Lambek calculus has the finite model property ⋮ Displaying and deciding substructural logics. I: Logics with contraposition ⋮ Normalized natural deduction systems for some relevant logics I: The logic DW ⋮ Simple Gentzenizations for the normal formulae of contraction-less logics ⋮ Rules in relevant logic. I: Semantic classification ⋮ Rules in relevant logic. II: Formula representation

Cites Work

• Unnamed Item
• Unnamed Item
• The consistency of the axiom of comprehension in the infinite-valued predicate logic of Lukasiewicz
• The Gentzenization and decidability of RW
• A metacompleteness theorem for contraction-free relevant logics
• \(TW_+\) and \(RW_+\) are decidable
• Inconsistency Tolerance

This page was built for publication: Gentzenization and decidability of some contraction-less relevant logics