On the Proof Complexities of Strongly Equal Non-classical Tautologies
Anahit Chubaryan & Sergey Sayadyan · Journal of Advances in Mathematics and Computer Science · 2014
The strong equality of classical tautologies and their proof complexities comparative analysis in certain proof systems were given by first author in previous studies. Here we introduce the analogous notions of strong equality for non-classical (intuitionistic and minimal) tautol...
Open access
Research Article
10.9734/BJMCS/2014/10972