Hypersequent Calculi Have Ackermannian Complexity

MaRDI QIDQ7219036arXivFDO

Authors A. R. Balasubramanian, Vitor Greati, Revantha Ramanayake

Publication date 2026

Published in arXiv

Mathematics Subject Classification ID

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

arXiv classification

cs.LO

This page was built for publication: Hypersequent Calculi Have Ackermannian Complexity

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