Forcing with random variables and proof complexity / Jan Krajíček
(London Mathematical Society lecture note series ; 382)
| データ種別 | 図書 |
|---|---|
| 出版者 | Cambridge [England] ; New York ; Tokyo : Cambridge University Press |
| 出版年 | 2011 |
| 本文言語 | 英語 |
| 大きさ | xvi, 247 p. ; 23 cm |
所蔵情報を非表示
| 配架場所 | 巻 次 | 請求記号 | 資料番号 | 状 態 | コメント | ISBN | 請求メモ | 予約 | 仮想書架 | 指定図書 |
|---|---|---|---|---|---|---|---|---|---|---|
| 泉:図書館閉架地下2階書庫 | : pbk | QA/267fk | a3010015747b |
|
9780521154338 |
|
書誌詳細を非表示
| 一般注記 | 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 |
|---|---|
| 著者標目 | Krajíček, Jan |
| 件 名 | LCSH:Computational complexity LCSH:Random variables LCSH:Mathematical analysis |
| 分 類 | LCC:QA267.7 DC22:511.3/6 |
| 書誌ID | 1001043125 |
| ISBN | 9780521154338 |
| NCID | BB04372449 |
類似資料
