Proof Complexity Generators
$146.30
- Paperback
143 pages
- Release Date
26 June 2025
Summary
Title: Unprovable Truths: Exploring the Frontiers of Proof Complexity
The P vs. NP problem stands as one of mathematics’ deepest unsolved mysteries, questioning whether efficiently verifiable proofs exist for all propositional tautologies. A negative resolution hinges on demonstrating the existence of inherently difficult-to-prove tautologies, regardless of the proof system employed. This is the central challenge of proof complexity, a vibrant field bridging mathematical logic and c…
Book Details
| ISBN-13: | 9781009611701 |
|---|---|
| ISBN-10: | 1009611704 |
| Series: | London Mathematical Society Lecture Note Series |
| Author: | Jan Krajíček |
| Publisher: | Cambridge University Press |
| Imprint: | Cambridge University Press |
| Format: | Paperback |
| Number of Pages: | 143 |
| Release Date: | 26 June 2025 |
| Weight: | 210g |
| Dimensions: | 228mm x 152mm x 8mm |
You Can Find This Book In
About The Author
Jan Krajíček
Jan Krajíček is Professor of Mathematical Logic at Charles University, Prague. A member of the Learned Society of the Czech Republic and the Academia Europaea, he has previously published three books with Cambridge University Press (1995, 2011 and 2019).
Returns
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.