Number of the records: 1
How Much Propositional Logic Suffices for Rosser's Undecidability Theorem?
SYS 0523434 LBL 01000a^^22220027750^450 005 20240103223922.2 014 $a 85091839606 $2 SCOPUS 014 $a 000797598200010 $2 WOS 017 $a 10.1017/S175502032000012X $2 DOI 100 $a 20200327d m y slo 03 ba 101 $a eng 102 $a GB 200 1-
$a How Much Propositional Logic Suffices for Rosser's Undecidability Theorem? 215 $a 18 s. 463 -1
$1 001 cav_un_epca*0343866 $1 011 $a 1755-0203 $e 1755-0211 $1 200 1 $a Review of Symbolic Logic $v Roč. 15, č. 2 (2022), s. 487-504 $1 210 $c Cambridge University Press 610 $a undecidability 610 $a substructural logic 610 $a Robinson arithmetic 700 -1
$3 cav_un_auth*0362070 $a Badia $b G. $y AT 701 -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 $T Ústav informatiky AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0100752 $a Hájek $b Petr $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*0378828 $a Tedder $b Andrew $p UIVT-O $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $w Department of Theoretical Computer Science $y CA $T Ústav informatiky AV ČR, v. v. i. 856 $u http://dx.doi.org/10.1017/S175502032000012X $9 RIV
Number of the records: 1