Number of the records: 1
Skolemization and Herbrand theorems for lattice-valued logics
SYS 0501613 LBL 01000a^^22220027750^450 005 20240103221609.1 014 $a 85061573241 $2 SCOPUS 014 $a 000466456500003 $2 WOS 017 $a 10.1016/j.tcs.2019.02.007 $2 DOI 100 $a 20190218d m y slo 03 ba 101 $a eng 102 $a NL 200 1-
$a Skolemization and Herbrand theorems for lattice-valued logics 215 $a 22 s. 463 -1
$1 001 cav_un_epca*0257658 $1 011 $a 0304-3975 $e 1879-2294 $1 200 1 $a Theoretical Computer Science $v Roč. 768, 10 May (2019), s. 54-75 $1 210 $c Elsevier 610 $a Skolemization 610 $a Herbrand theorems 610 $a Non-classical logics 610 $a Lattices 700 -1
$3 cav_un_auth*0100737 $a Cintula $b Petr $p UIVT-O $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $w Department of Theoretical Computer Science $z K $T Ústav informatiky AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0362703 $a Diaconescu $b D. $y RO 701 -1
$3 cav_un_auth*0266236 $a Metcalfe $b G. $y CH 856 $u http://dx.doi.org/10.1016/j.tcs.2019.02.007 $9 RIV
Number of the records: 1