All reports by Author Jochen Me\3ner:

__
TR97-026
| 18th June 1997
__

Jochen Me\3ner, Jacobo Toran#### Optimal proof systems for Propositional Logic and complete sets

Jochen Me\3ner, Jacobo Toran

A polynomial time computable function $h:\Sigma^*\to\Sigma^*$ whose range

is the set of tautologies in Propositional Logic (TAUT), is called

a proof system. Cook and Reckhow defined this concept

and in order to compare the relative strenth of different proof systems,

they considered the notion ...
more >>>