Conjunctively indecomposable formulas in propositional calculi
Izvestiya. Mathematics, Tome 3 (1969) no. 1, pp. 17-35
Cet article a éte moissonné depuis la source Math-Net.Ru
Formulas in intuitionistic propositional calculus and its subsystems are studied that cannot be decomposed into a proper conjunction.
@article{IM2_1969_3_1_a2,
author = {V. A. Yankov},
title = {Conjunctively indecomposable formulas in propositional calculi},
journal = {Izvestiya. Mathematics},
pages = {17--35},
year = {1969},
volume = {3},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_1969_3_1_a2/}
}
V. A. Yankov. Conjunctively indecomposable formulas in propositional calculi. Izvestiya. Mathematics, Tome 3 (1969) no. 1, pp. 17-35. http://geodesic.mathdoc.fr/item/IM2_1969_3_1_a2/
[1] Rasiowa H., Sikorski R., The mathematics of metamathematics, Warszawe, 1963 | MR
[2] Birkhgof G., Teoriya struktur, IL, M., 1952
[3] Yankov V., “O svyazi mezhdu vyvodimostyu v intuitsionistskom ischislenii vyskazyvanii i konechnymi implikativnymi strukturami”, Dokl. AN SSSR, 151:6 (1963), 1293–1294 | Zbl
[4] Klini S. K., Vvedenie v metamatematiku, IL, M., 1957
[5] Curry H., Lecons de logique algébrigue, Paris, 1952