Logical Foundations of Proof Complexity

Logical Foundations of Proof Complexity

Pris
1 229,-
E-Bok
E-bøkene legges i din ARK-leseapp. Bøkene kan også lastes ned fra Din side.
×
Logg deg inn for å gjennomføre dette kjøpet med ett klikk!

Etter at kjøpet er gjennomført vil boken være tilgjengelig på «din side» og i ARK-appen
Skriv anmeldelse
Format E-Bok
Filformat PDF
Utgivelsesår 2010
Forlag Cambridge University Press
Språk Engelsk
ISBN 9781107206717
Serie Perspectives in Logic
Se flere detaljer  

Om Logical Foundations of Proof Complexity

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.


Kundevurderinger

ARKs anbefalinger

Det finnes ingen vurderinger av dette produktet. Skriv anmeldelse

Mer fra Phuong Nguyen; Stephen Cook

Anbefalt


Tips en venn