0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

Bounded Arithmetic, Propositional Logic and Complexity Theory (Hardcover) Loot Price: R3,912
Discovery Miles 39 120
Bounded Arithmetic, Propositional Logic and Complexity Theory (Hardcover): Jan Krajicek

Bounded Arithmetic, Propositional Logic and Complexity Theory (Hardcover)

Jan Krajicek

Series: Encyclopedia of Mathematics and its Applications

 (sign in to rate)
Loot Price R3,912 Discovery Miles 39 120 | Repayment Terms: R367 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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.

General

Imprint: Cambridge UniversityPress
Country of origin: United Kingdom
Series: Encyclopedia of Mathematics and its Applications
Release date: November 1995
First published: 1995
Authors: Jan Krajicek
Dimensions: 242 x 162 x 27mm (L x W x T)
Format: Hardcover
Pages: 360
ISBN-13: 978-0-521-45205-2
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic
Promotions
LSN: 0-521-45205-8
Barcode: 9780521452052

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Machine Learning with Quantum Computers
Maria Schuld, Francesco Petruccione Hardcover R3,839 Discovery Miles 38 390
Discrete and Combinatorial Mathematics…
Ralph Grimaldi Paperback R2,537 Discovery Miles 25 370
Forbidden Configurations in Discrete…
David Eppstein Hardcover R2,925 Discovery Miles 29 250
Modeling and Simulating Complex Business…
Zoumpolia Dikopoulou Hardcover R3,794 Discovery Miles 37 940
Numerical Geometry, Grid Generation and…
Vladimir A. Garanzha, Lennard Kamenski, … Hardcover R6,719 Discovery Miles 67 190
Techniques for Searching, Parsing, and…
Alberto Pettorossi Hardcover R2,833 Discovery Miles 28 330
Probability in Electrical Engineering…
Jean Walrand Hardcover R1,664 Discovery Miles 16 640
Fundamentals of Logic and Computation…
Zhe Hou Hardcover R996 Discovery Miles 9 960
Advanced Topics in Bisimulation and…
Davide Sangiorgi, Jan Rutten Hardcover R2,858 Discovery Miles 28 580
Schwarz Methods and Multilevel…
Ernst P. Stephan, Thanh Tran Hardcover R5,065 Discovery Miles 50 650
Hajnal Andreka and Istvan Nemeti on…
Judit Madarasz, Gergely Szekely Hardcover R3,123 Discovery Miles 31 230
Logic and Implication - An Introduction…
Petr Cintula, Carles Noguera Hardcover R3,629 Discovery Miles 36 290

See more

Partners