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,747
Discovery Miles 37 470
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,747 Discovery Miles 37 470 | Repayment Terms: R351 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 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..

Creativity in Computing and DataFlow…
Suyel Namasudra, Veljko Milutinovic Hardcover R4,204 Discovery Miles 42 040
Agent-Based Modeling and Network…
Akira Namatame, Shu-Heng Chen Hardcover R2,970 Discovery Miles 29 700
Fibonacci Cubes With Applications And…
Omer Egecioglu, Sandi Klavzar, … Hardcover R2,380 Discovery Miles 23 800
Digital Protection for Power Systems
Salman K. Salman, A.T. Johns Hardcover R3,128 R2,831 Discovery Miles 28 310
Theory and Computation of Tensors…
Yimin Wei, Weiyang Ding Paperback R1,372 Discovery Miles 13 720
Advanced Topics in Bisimulation and…
Davide Sangiorgi, Jan Rutten Hardcover R3,205 Discovery Miles 32 050
Numerical Time-Dependent Partial…
Moysey Brio, Gary M. Webb, … Hardcover R3,033 R2,850 Discovery Miles 28 500
Restricted Congruences in Computing
Khodakhast Bibak Hardcover R1,666 Discovery Miles 16 660
Conceptual Spaces: Elaborations and…
Mauri Kaipainen, Frank Zenker, … Hardcover R3,112 Discovery Miles 31 120
Handbook of Research on Emerging Trends…
Arun Solanki, Sandeep Kumar, … Hardcover R10,356 Discovery Miles 103 560
Numerical Methods for Linear Control…
Biswa Datta Hardcover R2,251 Discovery Miles 22 510
Essential Linear Algebra with…
Titu Andreescu Hardcover R2,882 Discovery Miles 28 820

See more

Partners