Forcing with Random Variables and Proof Complexity Image close
Forcing with Random Variables and Proof Complexity by Jan Krajicek
Forcing with Random Variables and Proof Complexity by Jan Krajicek
Show Hide Adult Content
Forcing with Random Variables and Proof Complexity close

Non-Fiction Books:

Home  
Books  
Non-Fiction  
Maths & Science  
Mathematics  
Mathematical foundations  
Mathematical logic

Forcing with Random Variables and Proof Complexity

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Paperback / softback
$167.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $41.75 with Afterpay Learn more

6 weekly interest-free payments of $27.83 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 11-21 June using International Courier

Explore more London Mathematical Society Lecture Note Series,

See all products in this series

Independence-Friendly Logic by Allen L. Mann
$218.00
Independence-Friendly Logic
by Allen L. Mann ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Locally Presentable and Accessible Categories by J. Rosicky
$291.00
Locally Presentable and Accessible Categories
by J. Rosicky ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Stable Groups by F. Wagner
$198.00
Stable Groups
by F. Wagner ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Synthetic Differential Topology by Marta Bunge
$214.00
Synthetic Differential Topology
by Marta Bunge ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Computability, Enumerability, Unsolvability
$165.00
Computability, Enumerability, Unsolvability
Paperback / softback
Available - Usually ships in 3-4 weeks
O-Minimality and Diophantine Geometry
$194.00
O-Minimality and Diophantine Geometry
Paperback / softback
Available - Usually ships in 3-4 weeks
Appalachian Set Theory
$213.00
Appalachian Set Theory
Paperback / softback
Available - Usually ships in 3-4 weeks
The Logical Approach to Automatic Sequences by Jeffrey Shallit
$231.00
The Logical Approach to Automatic Sequences
by Jeffrey Shallit ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Boolean Function Complexity
$116.00
Boolean Function Complexity
Paperback / softback
Available - Usually ships in 3-4 weeks
Complexity: Knots, Colourings and Countings by Dominic Welsh
$167.00
Complexity: Knots, Colourings and Countings
by Dominic Welsh ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Foundations of Computational Mathematics, Minneapolis 2002
$182.00
Foundations of Computational Mathematics, Minneapolis 2002
Paperback / softback
Available - Usually ships in 3-4 weeks
Models and Computability
$186.00
Models and Computability
Paperback / softback
Available - Usually ships in 3-4 weeks
Motivic Integration and its Interactions with Model Theory and Non-Archimedean Geometry: Volume 1
$231.00
Motivic Integration and its Interactions with Model Theory and...
Paperback / softback
Available - Usually ships in 3-4 weeks
Elliptic Curves in Cryptography by I. Blake
$223.00
Elliptic Curves in Cryptography
by I. Blake ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Sets and Proofs
$187.00
Sets and Proofs
Paperback / softback
Available - Usually ships in 3-4 weeks
Advances in Linear Logic
$200.00
Advances in Linear Logic
Paperback / softback
Available - Usually ships in 3-4 weeks

Description

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.

Author Biography:

Jan Krajíček is a Professor of Mathematical Logic at Charles University in Prague. He is currently also affiliated with the Academy of Sciences of the Czech Republic.
Release date NZ
December 23rd, 2010
Author
Audience
  • Professional & Vocational
Illustrations
Worked examples or Exercises
Pages
264
Dimensions
152x228x15
ISBN-13
9780521154338
Product ID
9987146

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Explore more by Jan Krajicek

See all books by this author

Bounded Arithmetic, Propositional Logic and Complexity Theory on Hardback by Jan Krajicek
$383.00
Bounded Arithmetic, Propositional Logic and Complexity Theory
by Jan Krajicek ~ Hardback
Available - Usually ships in 3-4 weeks
Proof Complexity on Hardback by Jan Krajicek
$403.00
Proof Complexity
by Jan Krajicek ~ Hardback
Available - Usually ships in 3-4 weeks

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Non-Fiction >
Maths & Science >
Mathematics >
Mathematical foundations >
Mathematical logic
Books >
Computers & Internet >
Theory & Design >
Mathematical theory of computation
Books >
Computers & Internet >
Computer science >
Mathematical theory of computation