Proof Complexity and Feasible Arithmetics
Home > Mathematics and Science Textbooks > Mathematics > Mathematical foundations > Mathematical logic > Proof Complexity and Feasible Arithmetics: (Series in Discrete Mathematics & Theoretical Computer Science)
Proof Complexity and Feasible Arithmetics: (Series in Discrete Mathematics & Theoretical Computer Science)

Proof Complexity and Feasible Arithmetics: (Series in Discrete Mathematics & Theoretical Computer Science)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Questions of mathematical proof and logical inference have been a significant thread in modern mathematics and have played a formative role in the development of computer science and artificial intelligence. Research in proof complexity and feasible theories of arithmetic aims at understanding not only whether logical inferences can be made, but also what resources are required to carry them out. Understanding the resources required for logical inferences has major implications for some of the most important problems in computational complexity, particularly the problem of whether NP is equal to co-NP. In addition, these have important implications for the efficiency of automated reasoning systems. The last dozen years have seen several breakthroughs in the study of these resource requirements.Papers in this volume represent the proceedings of the DIMACS workshop on 'Feasible Arithmetics and Proof Complexity' held in April 1996 at Rutgers University in New Jersey as part of the DIMACS Institute's Special Year on Logic and Algorithms. This book brings together some of the most recent work of leading researchers in proof complexity and feasible arithmetic reflecting many of these advances. It covers a number of aspects of the field, including lower bounds in proof complexity, witnessing theorems and proof systems for feasible arithmetic, algebraic and combinatorial proof systems, interpolation theorems, and the relationship between proof complexity and Boolean circuit complexity.

Table of Contents:
Plausibly hard combinatorial tautologies by J. Avigad More on the relative strength of counting principles by P. Beame and S. Riis Ranking arithmetic proofs by implicit ramification by S. J. Bellantoni Lower bounds on Nullstellensatz proofs via designs by S. R. Buss Relating the provable collapse of $\mathbfP$ to $\mathrm {NC}^1$ and the power of logical theories by S. Cook On $PHP$, $st$-connectivity, and odd charged graphs by P. Clote and A. Setzer Descriptive complexity and the $W$ hierarchy by R. G. Downey, M. R. Fellows, and K. W. Regan Lower bounds on the sizes of cutting plane proofs for modular coloring principles by X. Fu Equational calculi and constant depth propositional proofs by J. Johannsen Exponential lower bounds for semantic resolution by S. Jukna Bounded arithmetic: Comparison of Buss' witnessing method and Sieg's Herbrand analysis by B. Kauffmann Towards lower bounds for bounded-depth Frege proofs with modular connectives by A. Maciel and T. Pitassi A quantifier-free theory based on a string algebra for $NC^1$ by F. Pitt A propositional proof system for $R^i_2$ by C. Pollett Algebraic models of computation and interpolation for algebraic proof systems by P. Pudlak and J. Sgall Self-reflection principles and NP-hardness by D. E. Willard.


Best Sellers


Product Details
  • ISBN-13: 9780821805770
  • Publisher: American Mathematical Society
  • Publisher Imprint: American Mathematical Society
  • Language: English
  • Series Title: Series in Discrete Mathematics & Theoretical Computer Science
  • ISBN-10: 0821805770
  • Publisher Date: 01 Jan 1998
  • Binding: Hardback
  • No of Pages: 320
  • Weight: 780 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Proof Complexity and Feasible Arithmetics: (Series in Discrete Mathematics & Theoretical Computer Science)
American Mathematical Society -
Proof Complexity and Feasible Arithmetics: (Series in Discrete Mathematics & Theoretical Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Proof Complexity and Feasible Arithmetics: (Series in Discrete Mathematics & Theoretical Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!