On proof normal forms for some systems of classical propositional logic

In this paper proof normal forms are given for some non-traditional systems of classical propositional logic. On basis of that forms the upper and lower bounds of proof complexity are given using the notion of $\varphi$-determinative disjunctive normal form.