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 ...Celý popis
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.
Prečo nakupovať na Enbooku?
VEĽKÝ VÝBER
Ponúkame milióny kníh v angličtine. Od beletrie až po tie najodbornejšie odborné.
POŠTOVNÉ ZADARMO
Poštovné už od 2,99 € a pri objednávke nad 60 € doprava na pobočku Zásielkovne zadarmo
SKVELÉ CENY
Ceny kníh sa snažíme držať pri zemi a vždy pod cenou odporúčanou vydavateľom, aby si ich mohol kúpiť naozaj každý.
OVERENÉ ZÁKAZNÍKMI
Získali sme certifikát "Overené zákazníkmi" na Heureka.sk. Prezrite si naše recenzie
ONLINE PODPORA
Môžete využiť online chat, email alebo nám zatelefonovať.