Polynomial space hardness without disjunction property

DOI10.1016/J.TCS.2012.08.025zbMath1298.68097OpenAlexW1986786317MaRDI QIDQ1935776

Simone Bova, Franco Montagna

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.025

zbMATH Keywords

computational complexitysubstructural logics

Mathematics Subject Classification ID

Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Other algebras related to logic (03G25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (1)

Obituary: Franco Montagna (1948--2015)

This page was built for publication: Polynomial space hardness without disjunction property