LE^t_ , LR^ _, LK and cutfree proofs

DOI10.1007/S10992-007-9048-0zbMATH Open1129.03033OpenAlexW40425547MaRDI QIDQ2454875FDOQ2454875

Katalin Bimbó

Publication date: 22 October 2007

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

Full work available at URL: https://doi.org/10.1007/s10992-007-9048-0

zbMATH Keywords

relevance logicscut eliminationstructurally free logics

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cut-elimination and normal-form theorems (03F05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Structural proof theory. With an appendix by Aarne Ranta
• Combinators and structurally free logic
• A Decision Procedure For the System E_Ī of Entailment with Negation
• Admissibility of cut in LC with fixed point combinator
• Two extensions of the structurally free logic LC

Cited In (6)

• New consecution calculi for \(R^{t}_{\to}\)
• About some symmetries of negation
• Valentini's cut-elimination for provability logic resolved
• RELEVANCE LOGICS AND RELATION ALGEBRAS
• Title not available (Why is that?)
• On the decidability of implicational ticket entailment

Uses Software

• Pesca

This page was built for publication: \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs

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