Arithmetic, Proof Theory, and Computational Complexity

by Clote

This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory" the study of bounded arithmetic, propositional proof systems, length of proof, and similar themes, and the relations of these topics to computational complexity theory. Issuing from a two-year international collaboration, the book contains articles concerning the existence of the most general unifier, a special case of Kreisel's conjecture on...

• Format: Hardcover
• Language: English
• ISBN: 0198536909
• ISBN13: 9780198536901
• Release Date: June 1993
• Publisher: Clarendon Press
• Length: 442 Pages
• Weight: 1.80 lbs.
• Dimensions: 1.1" x 6.0" x 9.0"