Mohlo by sa vám tiež páčiť

Viac informácií o knihe Forcing with Random Variables and Proof Complexity

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 177 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Mathematical foundations

• Celý názov: Forcing with Random Variables and Proof Complexity
• Autor: Jan Krajicek
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 264
• EAN: 9780521154338
• ISBN: 0521154332
• ID: 04090996
• Nakladateľ: Cambridge University Press
• Hmotnosť: 382 g
• Rozmery: 225 × 152 × 15 mm
• Dátum vydania: 23. December 2010

---

---

---