Number of the records: 1
Simulating non-prenex cuts in quantified propositional calculus
SYS 0364309 LBL 01369^^^^^2200313^^^450 005 20240103195530.8 014 $a 000295573600010 $2 WOS 014 $a 80053084541 $2 SCOPUS 017 $a 10.1002/malq.201020093 $2 DOI 100 $a 20111102d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a Simulating non-prenex cuts in quantified propositional calculus 215 $a 9 s. 463 -1
$1 001 cav_un_epca*0257223 $1 011 $a 0942-5616 $e 1521-3870 $1 200 1 $a Mathematical Logic Quarterly $v Roč. 57, č. 5 (2011), s. 524-532 $1 210 $c Wiley 610 0-
$a proof complexity 610 0-
$a prenex cuts 610 0-
$a quantified propositional calculus 700 -1
$3 cav_un_auth*0219256 $a Jeřábek $b Emil $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*0274397 $a Nguyen $b P. $y CA $4 070 856 $u http://onlinelibrary.wiley.com/doi/10.1002/malq.201020093/abstract
Number of the records: 1