Number of the records: 1  

Forcing with Random Variables and Proof Complexity

  1. SYS0369674
    LBL
      
    01237^^^^^2200337^^^450
    005
      
    20240103200104.2
    010
      
    $a 978-0-521-15433-8
    100
      
    $a 20111220d m y slo 03 ba
    101
    0-
    $a eng $d eng
    102
      
    $a GB
    200
    1-
    $a Forcing with Random Variables and Proof Complexity
    205
      
    $a 1st ed.
    210
      
    $a Cambridge $c Cambridge University Press $d 2011
    215
      
    $a 247 s. $8 500
    225
    1-
    $a London Mathematical Society Lecture Note Series $v 382
    300
      
    $a MSM0021620839
    610
    0-
    $a computational complexity
    610
    0-
    $a random variables
    610
    0-
    $a mathematical analysis
    700
    -1
    $3 cav_un_auth*0100670 $a Krajíček $b Jan $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $4 070 $T Matematický ústav AV ČR, v. v. i.
    856
      
    $u http://www.cambridge.org/gb/knowledge/isbn/item5705272/?site_locale=en_GB
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.