Jan Krajíček
Cambridge [England] ; New York ; Tokyo : Cambridge University Press, 2011
図書等| No. | 所在 | 請求記号 | 資料ID | 資料タイプ | 状況（返却予定日） | コレクション | 備考 | 予約・取り寄せ人数 |
|---|---|---|---|---|---|---|---|---|
|
1 |
410.8-L84-382
|
10010017601 |
一般図書 |
|
|
|
|
2011
xvi, 247 p. ; 23 cm
Summary: "This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional proof systems is equivalent to constructing certain extensions of models of bounded arithmetic. This offers a clean and coherent framework for thinking about lower bounds for proof lengths, and it has proved quite successful in the past. This book outlines a brand new method for constructing models of bounded arithmetic, thus for proving independence results and establishing lower bounds for proof lengths. The models are built from random variables defined on a sample space which is a non-standard finite set and sampled by functions of some restricted computational complexity. It will appeal to anyone interested in logical approaches to fundamental problems in complexity theory"--Provided by publisher
Includes bibliographical references (p. 236-242) and indexes
イギリス
英語 (eng)
英語 (eng)
LCC:QA267.7
DC22:511.3/6
9780521154338/0521154332 (: pbk)
BB04372449
LCCN : 2010036194
