Book 1359 views
Bounded Arithmetic and Resolution-Based Proof Systems
Arnold Beckmann 
Collegium Logicum, Volume: 7
Swansea University Author:
Arnold Beckmann
Abstract
This book is about two topics on the borderline between logic and complexity theory, and in particular about the connections between these. The first topic is Bounded Arithmetic, and the other is the complexity of propositional proof systems.
| Published in: | Collegium Logicum |
|---|---|
| ISBN: | 3-901546-02-2 |
| Published: |
Vienna
Kurt Gödel Society
2004
|
| Online Access: |
http://kgs.logic.at/index.php?id=9 |
| URI: | https://cronfa.swan.ac.uk/Record/cronfa14893 |
| Abstract: |
This book is about two topics on the borderline between logic and complexity theory, and in particular about the connections between these. The first topic is Bounded Arithmetic, and the other is the complexity of propositional proof systems. |
|---|---|
| College: |
Faculty of Science and Engineering |