Proof Complexity by Jan Krajek
Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject.-
The Theory of Partitions
-
The Banach-Tarski Paradox
-
Special Functions
-
Equivalents of the Riemann Hypothesis: Volume 1, Arithmetic Equivalents
-
Non-Associative Normed Algebras
-
Finite Precision Number Systems and Arithmetic
-
The Classical Fields
-
Handbook of Constructive Mathematics
-
Aperiodic Order: Volume 2, Crystallography and Almost Periodicity
-
Polynomials with Special Regard to Reducibility
-
Boolean Functions
-
Categorical Foundations
-
Introduction to the Network Approximation Method for Materials Modeling
-
Asymptotic Analysis of Random Walks
-
Contact Geometry and Nonlinear Differential Equations
-
Lie's Structural Approach to PDE Systems
-
Sub-Riemannian Geometry
-
Combinatorics, Automata and Number Theory
-
Variational Methods for Nonlocal Fractional Problems
-
Ergodic Control of Diffusion Processes
-
Algorithmic Aspects of Graph Connectivity
-
Topics in Algorithmic Graph Theory
-
Exact and Approximate Controllability for Distributed Parameter Systems
-
Mathematics of the Bond Market
-
Orthogonal Polynomials in the Spectral Analysis of Markov Processes
-
Real Analysis through Modern Infinitesimals
-
Introduction to Radon Transforms
-
Lattice Sums Then and Now
-
The Racah-Wigner Algebra in Quantum Theory
-
Boolean Models and Methods in Mathematics, Computer Science, and Engineering
-
Exact Constants in Approximation Theory
-
An Algebraic Introduction to K-Theory
-
Solving Polynomial Equation Systems IV: Volume 4, Buchberger Theory and Beyond
-
Infinite Dimensional Optimization and Control Theory
-
Banach Algebras and the General Theory of *-Algebras: Volume 1, Algebras and Banach Algebras
-
Geometry of Sporadic Groups: Volume 2, Representations and Amalgams
-
Ultrametric Pseudodifferential Equations and Applications
-
Compound Renewal Processes
-
General Orthogonal Polynomials
-
The Theory of Information and Coding
-
Convex Polytopes and Polyhedra
-
Stopping Times and Directed Processes
-
Nonnegative Matrices and Applications
-
Random Graphs
'… the book has very rich content and its bibliographical material includes all previous books and survey articles related to proof complexity' Anahit Artashes Chubaryan, MathSciNet
'This book is in my view an excellent reference manual for a fundamental topic in mathematical logic and theoretical computer science.' Jaap van Oosten, Boekbesprekingen
'This book is in my view an excellent reference manual for a fundamental topic in mathematical logic and theoretical computer science.' Jaap van Oosten, Boekbesprekingen
Jan Krajíček is Professor of Mathematical Logic in the Faculty of Mathematics and Physics at Charles University, Prague. He is a member of the Academia Europaea and of the Learned Society of the Czech Republic. He has been an invited speaker at the European Congress of Mathematicians and at the International Congresses of Logic, Methodology and Philosophy of Science.
| SKU | Unavailable |
| ISBN 13 | 9781108416849 |
| ISBN 10 | 1108416845 |
| Title | Proof Complexity |
| Author | Jan Krajek |
| Series | Encyclopedia Of Mathematics And Its Applications |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2019-03-28 |
| Number of pages | 530 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |