On the Proof Complexities of Strongly Equal Non-classical Tautologies
On the Proof Complexities of Strongly Equal Non-classical Tautologies | Chapter 06 | Advances in Mathematics and Computer Science Vol. 1
The strong equality of classical tautologies and their proof complexities comparative analysis incertain proof systems were given by first author in previous studies. Here we introduce the analogousnotions of strong equality for non-classical (intuitionistic and minimal) tautologies and investigatethe relations between the proof complexity measures of strongly equal non-classical tautologiesin some proof systems. We prove that 1) the strongly equal tautologies have the same proofcomplexities in some proof systems and 2) there are such proof systems, in which some measures ofproof complexities for strongly equal tautologies are the same, while the other measures differ fromeach other only as a function of the sizes of tautologies.
Author Details:
Anahit Chubaryan
Department of Informatics and Applied Mathematics, Yerevan State University, Armenia.
Sergey Sayadyan
Department of Informatics and Applied Mathematics, Yerevan State University, Armenia.
Read full article: http://bp.bookpi.org/index.php/bpi/catalog/view/46/225/385-1