Number of the records: 1
Parity games and propositional proofs
SYS 0422131 LBL 02253^^^^^2200361^^^450 005 20240103203546.5 014 $a 84885230768 $2 SCOPUS 014 $a 000342994500012 $2 WOS 017 70
$a 10.1007/978-3-642-40313-2_12 $2 DOI 100 $a 20140109d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a Parity games and propositional proofs 215 $a 12 s. $c P 463 -1
$1 001 cav_un_epca*0422130 $1 010 $a 978-3-642-40312-5 $1 200 1 $a Mathematical Foundations of Computer Science 2013 $v S. 111-122 $1 205 $a 1. $1 210 $a Berlin $c Springer $d 2013 $1 225 $a Lecture Notes in Computer Science $v 8087 $1 702 1 $a Chatterjee $b K. $4 340 $1 702 1 $a Sgall $b J. $4 340 610 0-
$a resolution proof systems 610 0-
$a parity games 610 0-
$a game equivalent to resolution 700 -1
$3 cav_un_auth*0298542 $a Beckmann $b A. $y GB $4 070 701 -1
$3 cav_un_auth*0100699 $a Pudlák $b Pavel $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. 701 -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://link.springer.com/chapter/10.1007%2F978-3-642-40313-2_12
Number of the records: 1