The Cook-Reckhow definition

09/09/2019
by   Jan Krajicek, et al.
0

The Cook-Reckhow 1979 paper defined the area of research we now call Proof Complexity. There were earlier papers which contributed to the subject as we understand it today, the most significant being Tseitin's 1968 paper, but none of them introduced general notions that would allow to make an explicit and universal link between lengths-of-proofs problems and computational complexity theory. In this note we shall highlight three particular definitions from the paper: of proof systems, p-simulations and the pigeonhole principle formula, and discuss their role in defining the field. We will also mention some related developments and open problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2023

Universal Proof Theory, TACL 2022 Lecture Notes

The subject of these short lecture notes is a recently emerging area wit...
research
09/13/2022

What is a combinatorial interpretation?

In this survey we discuss the notion of combinatorial interpretation in ...
research
01/09/2022

On proof theory in computational complexity: overview

In [GH1] and [GH2] (see also [GH3]) we presented full proof of the equal...
research
05/06/2019

The complexity of MinRank

In this note, we leverage some of our results from arXiv:1706.06319 to p...
research
11/16/2018

PRAMs over integers do not compute maxflow efficiently

Finding lower bounds in complexity theory has proven to be an extremely ...
research
10/20/2014

Certified Connection Tableaux Proofs for HOL Light and TPTP

In the recent years, the Metis prover based on ordered paramodulation an...
research
05/17/2018

Birnbaum-Saunders Distribution: A Review of Models, Analysis and Applications

Birnbaum and Saunders introduced a two-parameter lifetime distribution t...

Please sign up or login with your details

Forgot password? Click here to reset