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. Frege systems (more often known as Hilbert systems in general proof theory) are named after Gottlob Frege.

Formal definition

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

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=\varnothing$ ). 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 contradition from X.

Examples

Frege's propositional calculus is a Frege system.
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 $A\lor B$ from $A$ . However, adding the weakening rule: ${\frac {A}{A\lor B}}$ makes it implicationally complete. Resolution is also refutationally complete.

Properties

Reckhow's theorem (1979) 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 (Buss 1987).
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 $\phi$ is proportional to the logarithm of the minimal number of steps in a Frege proof of $\phi$ .

Proof strengths of different systems.

References

Krajíček, Jan (1995). "Bounded Arithmetic, Propositional Logic, and Complexity Theory", Cambridge University Press.
Cook, Stephen; Reckhow, Robert A. (1979). "The Relative Efficiency of Propositional Proof Systems". Journal of Symbolic Logic. 44 (1). pp. 36–50. JSTOR 2273702.
Buss, S. R. (1987). "Polynomial size proofs of the propositional pigeonhole principle", Journal of Symbolic Logic 52, pp. 916–927.
Pudlák, P., Buss, S. R. (1995). "How to lie without being (easily) convicted and the lengths of proofs in propositional calculus", in: Computer Science Logic'94 (Pacholski and Tiuryn eds.), Springer LNCS 933, 1995, pp. 151–162.

This article is issued from Wikipedia - version of the 9/10/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.