ON PROOF NORMAL FORMS FOR SOME SYSTEMS OF CLASSICAL PROPOSITIONAL LOGIC
DOI:
https://doi.org/10.46991/PYSU:A/2007.47.1.038Keywords:
non-traditional systems, disjunctive normal formAbstract
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
Issue
Section
Informatics
License
Copyright (c) 2007 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.