{"title":"Jan Krajek","description":null,"products":[{"product_id":"forcing-with-random-variables-and-proof-complexity-book-jan-krajek-9780521154338","title":"Forcing with Random Variables and Proof Complexity","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.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52516857970961,"sku":"NLS9780521154338","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52735401001233,"sku":"NIN9780521154338","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521154338.jpg?v=1786109731"},{"product_id":"proof-complexity-book-jan-krajek-9781108416849","title":"Proof Complexity","description":"Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52673167753489,"sku":"NLS9781108416849","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781108416849.jpg?v=1786278821"}],"url":"https:\/\/www.worldofbooks.com\/en-gb\/collections\/author-books-by-jan-krajek.oembed","provider":"World of Books ","version":"1.0","type":"link"}