\input zb-basic
\input zb-ioport
\iteman{io-port 05925529}
\itemau{Hor\v{c}{\'\i}k, Rostislav; Terui, Kazushige}
\itemti{Disjunction property and complexity of substructural logics.}
\itemso{Theor. Comput. Sci. 412, No. 31, 3992-4006 (2011).}
\itemab
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.
\itemrv{~}
\itemcc{}
\itemut{substructural logics; disjunction property; computational complexity}
\itemli{doi:10.1016/j.tcs.2011.04.004}
\end