On the complexity of proof in prepositional calculus
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part II, Tome 8 (1968), pp. 234-259
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{ZNSL_1968_8_a25,
author = {G. S. Tseitin},
title = {On the complexity of proof in prepositional calculus},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {234--259},
publisher = {mathdoc},
volume = {8},
year = {1968},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a25/}
}
G. S. Tseitin. On the complexity of proof in prepositional calculus. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part II, Tome 8 (1968), pp. 234-259. http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a25/