Tell your friends about this item:
Arithmetic, Proof Theory, and Computational Complexity - Oxford Logic Guides Peter Clote
Arithmetic, Proof Theory, and Computational Complexity - Oxford Logic Guides
Peter Clote
This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of references.
442 pages, line figures
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | May 6, 1993 |
| ISBN13 | 9780198536901 |
| Publishers | Oxford University Press |
| Pages | 442 |
| Dimensions | 162 × 242 × 30 mm · 810 g |
| Language | English |
| Editor | Clote, Peter (Professor, Department of Computer Science, Professor, Department of Computer Science, Boston College, Chestnut Hill, USA) |
| Editor | Krajicek, Jan (Mathematical Institute, Mathematical Institute, Ceskoslovenska Akademie Ved Praha 1, Czechoslovakia) |
More by Peter Clote
Show allMere med samme udgiver
See all of Peter Clote ( e.g. Hardcover Book and Paperback Book )