Vertel uw vrienden over dit artikel:
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 | Boeken Hardcover Book (Boek met harde rug en kaft) |
| Vrijgegeven | 6 mei 1993 |
| ISBN13 | 9780198536901 |
| Uitgevers | Oxford University Press |
| Pagina's | 442 |
| Afmetingen | 162 × 242 × 30 mm · 810 g |
| Taal en grammatica | Engels |
| Uitgever | Clote, Peter (Professor, Department of Computer Science, Professor, Department of Computer Science, Boston College, Chestnut Hill, USA) |
| Uitgever | Krajicek, Jan (Mathematical Institute, Mathematical Institute, Ceskoslovenska Akademie Ved Praha 1, Czechoslovakia) |