Complexity of admissible rules
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F07%3A00079877" target="_blank" >RIV/67985840:_____/07:00079877 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Complexity of admissible rules
Original language description
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionastic logics. We state a broad condition under which the admissibility problem is coNEXP-hard. We also show that admissibility in several well-known systems (including GL,S4, and IPC) is in coNE, thus obtaining a sharp complexity estimate for admissibility in these systems.
Czech name
Složitost přípustných pravidel
Czech description
Zkoumáme výpočetní složitost problému přípustnosti odvozovaných pravidel v modálních a superintuicionistických logikách. Ukážeme, že pro mnoho logik je tento problém coNEXP-úplný.
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
<a href="/en/project/IAA1019401" target="_blank" >IAA1019401: Theories, proofs and computational complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
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
Archive for Mathematical Logic
ISSN
0933-5846
e-ISSN
—
Volume of the periodical
46
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
20
Pages from-to
73-92
UT code for WoS article
—
EID of the result in the Scopus database
—