Special attention is paid to the most basic logic in this hierarchy, the pure "intelim logic", which satisfies all the requirements of a natural deduction system (allowing both introduction and ...

We prove that the problem of determining the minimum propositional proof length is NP- hard to approximate within a factor of 2 log1 - o (1)n. These results are very robust in that they hold for ...