The complexity of admissible rules of Łukasiewicz logic

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F13%3A00392459" target="_blank" >RIV/67985840:_____/13:00392459 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1093/logcom/exs007" target="_blank" >http://dx.doi.org/10.1093/logcom/exs007</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/logcom/exs007" target="_blank" >10.1093/logcom/exs007</a>

Result language
angličtina
Original language name
The complexity of admissible rules of Łukasiewicz logic
Original language description
We investigate the computational complexity of admissibility of inference rules in infinite-valued Łukasiewicz propositional logic (Ł). It was shown in [13] that admissibility in Ł is checkable in PSPACE. We establish that this result is optimal, i.e. admissible rules of Ł are PSPACE-complete. In contrast, derivable rules of Ł are known to be coNP-complete.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)