Bounded Arithmetic, Propositional Logic and Complexity Theory

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

Autor: Jan Krajicek

Limbă:

Legare: Copertă tare

Editura: Cambridge University Press

Disponibilitate: În depozitul extern

Expediem în 9-15 zile

954.23 lei

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

Informații despre carte

Autor

Jan Krajicek

Limbă

engleză

Legare

Carte - Copertă tare

Publicat

1995

Pagini

360

EAN

9780521452052

ISBN

0521452058

Enbook ID

02031381

Editura

Cambridge University Press

Greutate

672

Dimensiuni

236 x 159 x 31

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Bounded Arithmetic, Propositional Logic and Complexity Theory

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și