Bounded Arithmetic, Propositional Logic and Complexity Theory

Name: Bounded Arithmetic, Propositional Logic and Complexity Theory
Brand: Cambridge University Press
SKU: 9780521452052
Price: 173.63 EUR
Availability: InStock

Автор: Jan Krajicek

Език:

Корици: С твърди корици

Издател: Cambridge University Press

Наличност: Външен склад

Изпращаме след 9-15 дни

173.63 € 339.60 лв

This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity...

Информация за книгата

Автор

Jan Krajicek

Език

Английски език

Корици

Книга - С твърди корици

Издадена

1995

страници

360

EAN

9780521452052

ISBN

0521452058

Enbook ID

02031381

Издател

Cambridge University Press

Теглоt

672

Размери

236 x 159 x 31

Пълно описание

This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity theory is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. More advanced topics are then treated, including polynomial simulations and conservativity results, various witnessing theorems, the translation of bounded formulas (and their proofs) into propositional ones, the method of random partial restrictions and its applications, direct independence proofs, complete systems of partial relations, lower bounds to the size of constant-depth propositional proofs, the method of Boolean valuations, the issue of hard tautologies and optimal proof systems, combinatorics and complexity theory within bounded arithmetic, and relations to complexity issues of predicate calculus. Students and researchers in mathematical logic and complexity theory will find this comprehensive treatment an excellent guide to this expanding interdisciplinary area.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Bounded Arithmetic, Propositional Logic and Complexity Theory

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също