Name: Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback (Encyclopedia of Mathematics and its Applications) (en Inglés)
Price: 465.56 PEN
Availability: InStock
Author: Krajicek, Jan
ISBN: 9780521452052

portada Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback (Encyclopedia of Mathematics and its Applications) (en Inglés)

Formato

Libro Físico

Autor

Jan Krajicek

Editorial

Cambridge University Press

Año

1995

Idioma

Inglés

N° páginas

360

Encuadernación

Tapa Dura

Dimensiones

24.2 x 16.2 x 2.7 cm

Peso

0.65 kg.

ISBN

0521452058

ISBN13

9780521452052

N° edición

Categorías

Lógica matemática
Ciencias matemáticas

Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback (Encyclopedia of Mathematics and its Applications) (en Inglés)

Jan Krajicek (Autor) · Cambridge University Press · Tapa Dura

Libro Nuevo

S/ 465,56

S/ 931,12

Ahorras: S/ 465,56

50% descuento

Envío normal

Origen: España (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Viernes 14 de Junio y el Martes 25 de Junio.

Lo recibirás en cualquier lugar de Perú entre 2 y 5 días hábiles luego del envío.

Reseña del libro "Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback (Encyclopedia of Mathematics and its Applications) (en Inglés)"

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 is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. Then more advanced topics are 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, simple independence proofs, complete systems of partial relations, lower bounds to the size of constant-depth propositional proofs, the approximation method and the method of Boolean valuations, 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 his comprehensive treatment an excellent guide to this expanding interdisciplinary area.