The contraction rule and decision problems for logics without structural rules

DOI10.1007/BF00370189zbMath0739.03009MaRDI QIDQ1181491

Hiroakira Ono, Eiji Kiriyama

Publication date: 27 June 1992

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

zbMATH Keywords

decision problemscontraction ruleweak logics

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (5)

Interpolation via translations ⋮ FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE ⋮ UNIFORM INTERPOLATION IN SUBSTRUCTURAL LOGICS ⋮ Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials ⋮ Towards a non-classical meta-theory for substructural approaches to paradox

Cites Work

• Proof theory. 2nd ed
• Predicate logics without the structure rules
• Decision problems for propositional linear logic
• Modalities in Ackermann's “rigorous implication”
• A Decision Procedure For the System E_Ī of Entailment with Negation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The contraction rule and decision problems for logics without structural rules