Počet záznamů: 1
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
SYS 0369682 LBL 01737^^^^^2200313^^^450 005 20240103200104.7 014 $a 000300094700001 $2 WOS 014 $a 80054119010 $2 SCOPUS 017 70
$a 10.1007/s00153-011-0240-0 $2 DOI 100 $a 20120312d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem 215 $a 16 s. 463 -1
$1 001 cav_un_epca*0256186 $1 011 $a 0933-5846 $e 1432-0665 $1 200 1 $a Archive for Mathematical Logic $v Roč. 50, 7-8 (2011), s. 665-680 $1 210 $c Springer 610 0-
$a bounded arithmetic 610 0-
$a proof complexity 610 0-
$a search problems 700 -1
$3 cav_un_auth*0246710 $a Thapen $b Neil $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $w Mathematical Logic and Theoretical Computer Science $4 070 $T Matematický ústav AV ČR, v. v. i. 856 $u http://www.springerlink.com/content/l19kr20362065t86/
Počet záznamů: 1