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,656
Discovery Miles 36 560
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,656 Discovery Miles 36 560 | Repayment Terms: R343 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
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..

Recent Advances in Applications of…
Snehashish Chakraverty, Sanjeewa Perera Hardcover R3,050 Discovery Miles 30 500
Fibonacci Cubes With Applications And…
Omer Egecioglu, Sandi Klavzar, … Hardcover R2,499 Discovery Miles 24 990
Data-Driven Science and Engineering…
Steven L. Brunton, J. Nathan Kutz Hardcover R1,654 R1,562 Discovery Miles 15 620
Handbook of Biometric Anti-Spoofing…
Sebastien Marcel, Julian Fierrez, … Hardcover R6,209 Discovery Miles 62 090
Digital Protection for Power Systems
Salman K. Salman, A.T. Johns Hardcover R3,396 R2,978 Discovery Miles 29 780
Concise Guide to Quantum Machine…
Davide Pastorello Hardcover R4,038 Discovery Miles 40 380
Engineering Mathematics and Computing
Park Gyei-Kark, Dipak Kumar Jana, … Hardcover R1,504 Discovery Miles 15 040
Entanglement in Spin Chains - From…
Abolfazl Bayat, Sougato Bose, … Hardcover R2,895 Discovery Miles 28 950
Formal Verification of Structurally…
Alireza Mahzoon, Daniel Grosse, … Hardcover R2,552 Discovery Miles 25 520
Intensional First-Order Logic - From AI…
Zoran Majkic Hardcover R4,621 Discovery Miles 46 210
Probability in Electrical Engineering…
Jean Walrand Hardcover R1,532 Discovery Miles 15 320
Systematic Innovation Partnerships with…
Robert Nowak, Jerzy Chrzaszcz, … Hardcover R2,877 Discovery Miles 28 770

See more

Partners