On the complexity of the Leibniz hierarchy
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F19%3A00503852" target="_blank" >RIV/67985807:_____/19:00503852 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.apal.2019.02.003" target="_blank" >http://dx.doi.org/10.1016/j.apal.2019.02.003</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.apal.2019.02.003" target="_blank" >10.1016/j.apal.2019.02.003</a>
Alternative languages
Result language
angličtina
Original language name
On the complexity of the Leibniz hierarchy
Original language description
We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and protoalgebraic logics. Finally, the same problem for the class of truth-equational logic is shown to be hard for EXPTIME.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
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)
Others
Publication year
2019
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
Annals of Pure and Applied Logic
ISSN
0168-0072
e-ISSN
—
Volume of the periodical
170
Issue of the periodical within the volume
7
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
20
Pages from-to
805-824
UT code for WoS article
000467892300002
EID of the result in the Scopus database
2-s2.0-85062281263