BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

BOUNDED ARITHMETIC PROPOSITIONAL LOGICA AND COMPLEXITY THEORY

BOUNDED ARITHMETIC PROPOSITIONAL LOGICA AND COMPLEXITY THEORY

BOUNDED ARITHMETIC PROPOSITIONAL LOGICA AND COMPLEXITY THEORY
Stock photo: cover may vary

BOUNDED ARITHMETIC PROPOSITIONAL LOGICA AND COMPLEXITY THEORY Hardback - 1996

by KRAJICEK

Add to wish list
  • New
  • Hardback
New

Description

Cambridge University Press, 1996. HARDBACK. New.
Ask the seller a question Add to wish list
A$536.22
A$21.86 Delivery to USA
Standard delivery: 20 to 30 days
More delivery options
Ships from Sanctum Books (Delhi, India)
The BIBLIO Guarantee

Details

  • Title BOUNDED ARITHMETIC PROPOSITIONAL LOGICA AND COMPLEXITY THEORY
  • Author KRAJICEK
  • Binding Hardback
  • Edition First Edition
  • Condition New
  • Pages 360
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press, New York
  • Publication date 1996
  • Bookseller's Inventory # Cambridge-9780521452052
  • ISBN 9780521452052 / 0521452058
  • Weight 1.44 lbs (0.65 kg)
  • Dimensions 9.52 x 6.38 x 1.07 in (24.18 x 16.21 x 2.72 cm)
  • Category Science
  • Library of Congress subjects Computational complexity, Proposition (Logic)
  • Library of Congress Catalogue Number 94047054
  • Dewey Decimal Code 511.3
  • Quantity available 500

About Sanctum Books Delhi, India

Specialising in: Art, Archaeology, Art History, And Architecture, Dictionaries And Encyclopaedias, Indian History, Languages, Literature, And Linguistics, Music, Dance, Theatre, And Cinema, Numismatics, Philately, And Epigraphy, Philosophy & Philosophy Of Science, Religion (Buddhism, Jainism, Hinduism, Sikhism, And Islam)
Biblio member since 2010

We are leading publishers, booksellers, distributors, importers, and exporters. We carry a large selection of books on varied subjects. Do place your valued order or let us know your requirement via email.

Terms of Sale:

30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

�

Books are shipped by Registered Air Mail or DHL/FedEx/Aramex. Additional shipping charges may be required for multi-volume sets.

Browse books from Sanctum Books

Reader reviews for BOUNDED ARITHMETIC PROPOSITIONAL LOGICA AND COMPLEXITY THEORY

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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.

Please wait a moment while we load the requested page.

tracking-