ON PROOF NORMAL FORMS FOR SOME SYSTEMS OF CLASSICAL PROPOSITIONAL LOGIC

S. R. Aleksanyan

doi:10.46991/PYSU:A/2007.47.1.038

ON PROOF NORMAL FORMS FOR SOME SYSTEMS OF CLASSICAL PROPOSITIONAL LOGIC

Authors

S. R. Aleksanyan Chair of Discrete Mathematics and Theoretical Informatics, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSU:A/2007.47.1.038

Keywords:

non-traditional systems, disjunctive normal form

Abstract

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.

Downloads

Published

2007-03-05

How to Cite

Aleksanyan, S. R. (2007). ON PROOF NORMAL FORMS FOR SOME SYSTEMS OF CLASSICAL PROPOSITIONAL LOGIC. Proceedings of the YSU A: Physical and Mathematical Sciences, 41(1 (212), 38–45. https://doi.org/10.46991/PYSU:A/2007.47.1.038