Počet záznamů: 1
Full Lambek Calculus with Contraction is Undecidable
SYS 0442807 LBL 01358^^^^^2200301^^^450 005 20240103205923.1 014 $a 84977178290 $2 SCOPUS 014 $a 000379947600008 $2 WOS 017 70
$a 10.1017/jsl.2015.18 $2 DOI 100 $a 20150325d m y slo 03 ba 101 0-
$a eng 102 $a US 200 1-
$a Full Lambek Calculus with Contraction is Undecidable 215 $a 17 s. 463 -1
$1 001 cav_un_epca*0257123 $1 011 $a 0022-4812 $e 1943-5886 $1 200 1 $a Journal of Symbolic Logic $v Roč. 81, č. 2 (2016), s. 524-540 $1 210 $c Cambridge University Press 610 0-
$a substructural logic 610 0-
$a full Lambek calculus 610 0-
$a contraction rule 610 0-
$a square-increasing residuated lattice 610 0-
$a equational theory 610 0-
$a decidability 700 -1
$3 cav_un_auth*0242277 $w Department of Theoretical Computer Science $4 070 $a Chvalovský $b Karel $p UIVT-O $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $T Ústav informatiky AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0208971 $w Department of Theoretical Computer Science $4 070 $a Horčík $b Rostislav $p UIVT-O $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $T Ústav informatiky AV ČR, v. v. i.
Počet záznamů: 1