Forcing with random variables and proof complexity [electronic resource] / Jan Krajíček.
"This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional...
| Uniform Title: | London Mathematical Society lecture note series ;
382. |
|---|---|
| Main Author: | |
| Language: | English |
| Published: |
Cambridge, UK ; New York :
Cambridge University Press,
2011.
|
| Series: | London Mathematical Society lecture note series ;
382. |
| Subjects: | |
| Online Access: | |
| Format: | Electronic eBook |
System Under Maintenance
Our Library Management System is currently under maintenance.
Holdings and item availability information is currently unavailable. Please accept our apologies for any inconvenience this may cause and contact us for further assistance:
Please contact Reference and Discovery Services via their Contact Form or call them directly at: 517-353-8700 for assistance.Online Access
EBSCO eBooks: 2011 (EBSCO)eBook Academic Collection (EBSCOhost) – North America: 2011 (EBSCO)