Complexities of Well-Quasi-Ordered Substructural Logics

MaRDI QIDQ7175710arXivFDO

Authors Nikolaos Galatos, Vitor Greati, Revantha Ramanayake, Gavin st. John

Publication date 2025

Published in arXiv

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Recursive functions and relations, subrecursive hierarchies (03D20) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Logical aspects of lattices and related structures (03G10) Ordered semigroups and monoids (06F05) Lattices of varieties (08B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

arXiv classification

cs.LO

This page was built for publication: Complexities of Well-Quasi-Ordered Substructural Logics

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