Disjunction Property and Complexity of Substructural Logics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F11%3A00368496" target="_blank" >RIV/67985807:_____/11:00368496 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.tcs.2011.04.004" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2011.04.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2011.04.004" target="_blank" >10.1016/j.tcs.2011.04.004</a>
Alternative languages
Result language
angličtina
Original language name
Disjunction Property and Complexity of Substructural Logics
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
412
Issue of the periodical within the volume
31
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
15
Pages from-to
3992-4006
UT code for WoS article
000292353400002
EID of the result in the Scopus database
—