Journal of Advances in Applied Mathematics
Bounds of Proof Complexities in Some Systems for Many Valued Logics
- Arman Tshitoyan*
PhD Student, Department of Informatics and Applied Mathematics, Yerevan State University, Yerevan, Armenia
 J. Lukasiewicz, O Logice Trojwartosciowej (On three-valued logic), Ruch Filozoficzny (Lwow), Vol.5, 1920, 169- 171.
 An.Chubaryan, Relative efficiency of some proof systems for classical propositional logic, Proceedings of NASA RA, Vol.37,N5,2002, and Journal of CMA (AAS), Vol.37, N5, 2002, 71-84.
 A.A.Chubaryan, A.S.Tshitoyan, A.A.Khamisyan, On some proof systems for many-valued logics and on proof complexities in it, (in Russian) Reports of NASA RA, Vol.116, N2, 2016, 18-24.
 Chubaryan Anahit, Khamisyan Artur, Generalization of Kalmar’s proof of deducibility in two valued propositional logic into many valued logic, Pure and Applied Mathematics Journal, Vol 6, No. 2, 2017, doi: 10.116448/j.pamj. 20170602.12.,71-75.
 Y. Filmus, M. Lauria, J. Nordstrom, N. Thapen, N. Ron-Zewi: Space Complexity in Polynomial Calculus, 2012 IEEE Conference on Computational Complexity (CCC), 2012, 334-344.