Forcing with random variables and proof complexity

Web Site CiNii 所蔵館 41館

書誌事項

タイトル
"Forcing with random variables and proof complexity"
責任表示
Jan Krajíček
出版者
  • Cambridge University Press
出版年月
  • 2011
書籍サイズ
23 cm
シリーズ名/番号
  • : pbk

この図書・雑誌をさがす

注記

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

関連図書・雑誌

もっと見る

詳細情報 詳細情報について

ページトップへ