Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2007), pp. 39-45
Citer cet article
S. R. Aleksanyan. On proof normal forms for some systems of classical propositional logic. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2007), pp. 39-45. http://geodesic.mathdoc.fr/item/UZERU_2007_1_a4/
@article{UZERU_2007_1_a4,
author = {S. R. Aleksanyan},
title = {On proof normal forms for some systems of classical propositional logic},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {39--45},
year = {2007},
number = {1},
language = {hy},
url = {http://geodesic.mathdoc.fr/item/UZERU_2007_1_a4/}
}
TY - JOUR
AU - S. R. Aleksanyan
TI - On proof normal forms for some systems of classical propositional logic
JO - Proceedings of the Yerevan State University. Physical and mathematical sciences
PY - 2007
SP - 39
EP - 45
IS - 1
UR - http://geodesic.mathdoc.fr/item/UZERU_2007_1_a4/
LA - hy
ID - UZERU_2007_1_a4
ER -
%0 Journal Article
%A S. R. Aleksanyan
%T On proof normal forms for some systems of classical propositional logic
%J Proceedings of the Yerevan State University. Physical and mathematical sciences
%D 2007
%P 39-45
%N 1
%U http://geodesic.mathdoc.fr/item/UZERU_2007_1_a4/
%G hy
%F UZERU_2007_1_a4
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.
[1] S. Buss, “Propositional Proof Complexity (Introduction)”, Handbook of Proof Theory, North-Holland, 1998 | MR
[2] A. A. Chubaryan, “Otnositelnaya effektivnost nekotorykh sistem dokazatelstv klassicheskoi propozitsionalnoi logiki”, Izvestiya NAN Armenii: Matematika, 37:5 (2002), 71–84 | MR | Zbl
