Number of the records: 1
On the complexity of the Leibniz hierarchy
SYS 0503852 LBL 01000a^^22220027750^450 005 20240103221917.1 014 $a 85062281263 $2 SCOPUS 014 $a 000467892300002 $2 WOS 017 $a 10.1016/j.apal.2019.02.003 $2 DOI 100 $a 20190409d m y slo 03 ba 101 $a eng 102 $a NL 200 1-
$a On the complexity of the Leibniz hierarchy 215 $a 20 s. $c P 463 -1
$1 001 cav_un_epca*0256135 $1 011 $a 0168-0072 $e 1873-2461 $1 200 1 $a Annals of Pure and Applied Logic $v Roč. 170, č. 7 (2019), s. 805-824 $1 210 $c Elsevier 610 $a Abstract algebraic logic 610 $a Leibniz hierarchy 610 $a Algebraizable logic 610 $a Protoalgebraic logic 610 $a Complexity theory 700 -1
$3 cav_un_auth*0333530 $a Moraschini $b Tommaso $p UIVT-O $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $w Department of Theoretical Computer Science $y ES $T Ústav informatiky AV ČR, v. v. i. 856 $9 RIV $u http://dx.doi.org/10.1016/j.apal.2019.02.003
Number of the records: 1