Frege system

In proof complexity, a Frege system is a propositional proof system whose proofs are sequences of formulas derived using a finite set of sound and implicationally complete inference rules. ^[1] Frege systems (more often known as Hilbert systems in general proof theory) are named after Gottlob Frege.

The name "Frege system" was first defined ^[2] by Stephen Cook and Robert Reckhow, ^{[3] [4]} and was intended to capture the properties of the most common propositional proof systems. ^[2]

Formal definition

Cook and Reckhow ^{[3] [4]} gave the first ^[2] formal definition of a Frege system, to which the one below, based on Krajicek, ^[1] is equivalent.

Let K be a finite functionally complete set of Boolean connectives, and consider propositional formulas built from variables p₀, p₁, p₂, ... using K-connectives. A Frege rule is an inference rule of the form

${\displaystyle r={\frac {B_{1},\dots ,B_{n}}{B}},}$

where B₁, ..., B_n, B are formulas. If R is a finite set of Frege rules, then F = (K,R) defines a derivation system in the following way. If X is a set of formulas, and A is a formula, then an F-derivation of A from axioms X is a sequence of formulas A₁, ..., A_m such that A_m = A, and every A_k is a member of X, or it is derived from some of the formulas A_i, i < k, by a substitution instance of a rule from R. An F-proof of a formula A is an F-derivation of A from the empty set of axioms (X=∅). F is called a Frege system if

• F is sound: every F-provable formula is a tautology.
• F is implicationally complete: for every formula A and a set of formulas X, if X entails A, then there is an F-derivation of A from X.

The length (number of lines) in a proof A₁, ..., A_m is m. The size of the proof is the total number of symbols.

A derivation system F as above is refutationally complete, if for every inconsistent set of formulas X, there is an F-derivation of a fixed contradiction from X.

Examples

• Frege's propositional calculus is not a Frege system, since it used axioms instead of axiom schemes, although it can be modified to be a Frege system. ^[4]
• There are many examples of sound Frege rules on the Propositional calculus page.
• Resolution is not a Frege system because it only operates on clauses, not on formulas built in an arbitrary way by a functionally complete set of connectives. Moreover, it is not implicationally complete, i.e. we cannot conclude ${\displaystyle A\lor B}$ from ${\displaystyle A}$. However, adding the weakening rule: ${\displaystyle {\frac {A}{A\lor B}}}$ makes it implicationally complete ^{[ citation needed ]}. Resolution is also refutationally complete.

Properties

• Reckhow's 1979 theorem ^[4] states that all Frege systems are p-equivalent.
• Natural deduction and sequent calculus (Gentzen system with cut) are also p-equivalent to Frege systems.
• There are polynomial-size Frege proofs of the pigeonhole principle. ^[5]
• Frege systems are considered to be fairly strong systems. Unlike, say, resolution, there are no known superlinear lower bounds on the number of lines in Frege proofs, and the best known lower bounds on the size of the proofs are quadratic.
• The minimal number of rounds in the prover-adversary game needed to prove a tautology ${\displaystyle \phi }$ is proportional to the logarithm of the minimal number of steps in a Frege proof of ${\displaystyle \phi }$.

• 
  Proof strengths of different systems.

Extended Frege system

Cook and Reckhow also defined an extension of a Frege system, called extended Frege, ^[4] which takes a Frege system F and adds an extra derivation rule which allows one to derive a formula ${\displaystyle p\leftrightarrow D}$, where ${\displaystyle \leftrightarrow }$ abbreviates its definition in the language of the particular F and the atom ${\displaystyle p}$ does not occur in previously derived formulas including axioms and in the formula ${\displaystyle D}$.

The purpose of the new derivation rule is to introduce 'names' or shortcuts for arbitrary formulas. It allows one to interpret proofs in Extended Frege as Frege proofs operating with circuits instead of formulas.

Cook's correspondence allows one to interpret Extended Frege as a nonuniform equivalent of Cook's theory PV and Buss's theory ${\displaystyle S_{2}^{1}}$ formalizing feasible (polynomial-time) reasoning.

References

1. Krajicek, Jan (1995-11-24). Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press. p. 42. ISBN   978-0-521-45205-2.
2. Pudlák, Pavel; Buss, Samuel R. (1995). "How to lie without being (easily) convicted and the lengths of proofs in propositional calculus". In Pacholski, Leszek; Tiuryn, Jerzy (eds.). Computer Science Logic. Lecture Notes in Computer Science. Vol. 933. Berlin, Heidelberg: Springer. pp. 151–162. doi:10.1007/BFb0022253. ISBN   978-3-540-49404-1.
3. Cook, Stephen; Reckhow, Robert (1974-04-30). "On the lengths of proofs in the propositional calculus (Preliminary Version)". Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74. New York, NY, USA: Association for Computing Machinery. pp. 135–148. doi:10.1145/800119.803893. ISBN   978-1-4503-7423-1.
4. Cook, Stephen A.; Reckhow, Robert A. (1979). "The relative efficiency of propositional proof systems" . The Journal of Symbolic Logic. 44 (1): 36–50. doi:10.2307/2273702. ISSN   0022-4812. JSTOR   2273702.
5. Buss, Samuel R. (1987). "Polynomial Size Proofs of the Propositional Pigeonhole Principle" . The Journal of Symbolic Logic. 52 (4): 916–927. doi:10.2307/2273826. ISSN   0022-4812. JSTOR   2273826.