Forcing with Random Variables and Proof Complexity / Jan Krajíček.
Material type:
TextSeries: London Mathematical Society Lecture Note Series ; no. 382Publisher: Cambridge : Cambridge University Press, 2010Description: 1 online resource (264 pages) : digital, PDF file(s)Content type: text Media type: computer Carrier type: online resourceISBN: 9781139107211 (ebook)Other title: Forcing with Random Variables & Proof ComplexitySubject(s): Computational complexity | Random variables | Mathematical analysisAdditional physical formats: Print version: : No titleDDC classification: 511.3/6 LOC classification: QA267.7 | .K73 2011Online resources: Click here to access online 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.
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK11978 |
Title from publisher's bibliographic system (viewed on 16 Oct 2015).
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.
There are no comments on this title.