Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Bounded Arithmetic, Propositional Logic and Complexity Theory

Gian-Carlo Rota

5/5 ( ratings)

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 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.

Language: English

Pages: 360

Format: Hardcover

Publisher: Cambridge University Press

Release: November 24, 1995

ISBN: 0521452058

ISBN 13: 9780521452052

Bounded Arithmetic, Propositional Logic and Complexity Theory

Gian-Carlo Rota

5/5 ( ratings)

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 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.

Language: English

Pages: 360

Format: Hardcover

Publisher: Cambridge University Press

Release: November 24, 1995

ISBN: 0521452058

ISBN 13: 9780521452052

More books from Gian-Carlo Rota

Indiscrete Thoughts

4.2/5 ( ratings)

Discrete Thoughts: Essays on Mathematics, Science and Philosophy

4.3/5 ( ratings)

Μαθηματικά και Φιλοσοφία – Το χρονικό μιας παρανόησης

3.2/5 ( ratings)

Science, Computers, and People: From the Tree of Mathematics

Μαθηματικά, φιλοσοφία και τεχνητή νοημοσύνη...Ένας διάλογος με τον Gian-Carlo Rota και τον David Sharp

3.6/5 ( ratings)

Mathematical Theory of Entropy

Control Theory for Partial Differential Equations: Volume 1, Abstract Parabolic Systems: Continuous and Approximation Theories

The Logic of Quantum Mechanics

Product Integration with Application to Differential Equations

Solving Polynomial Equation Systems II: Macaulay's Paradigm and Gr�bner Technology

Essays on the Future: In Honor of Nick Metropolis

Selected Papers of Norman Levinson

Functional Equations in Several Variables

Permanents

The Logic of Quantum Mechanics: Volume 15

Rate this book!

Write a review?