@article {IOPORT.05925529,
    author       = {Hor\v{c}{\'\i}k, Rostislav and Terui, Kazushige},
    title        = {Disjunction property and complexity of substructural logics.},
    year         = {2011},
    journal      = {Theoretical Computer Science},
    volume       = {412},
    number       = {31},
    issn         = {0304-3975},
    pages        = {3992-4006},
    publisher    = {Elsevier Science Publishers, Amsterdam},
    doi          = {10.1016/j.tcs.2011.04.004},
    abstract     = {Summary: We systematically identify a large class of substructural logics that satisfy the disjunction property (DP), and show that every consistent substructural logic with the DP is PSPACE-hard. Our results are obtained by using algebraic techniques. PSPACE-completeness for many of these logics is furthermore established by proof-theoretic arguments.},
    identifier   = {05925529},
}