Conjunctively indecomposable formulas in propositional calculi
Izvestiya. Mathematics, Tome 3 (1969) no. 1, pp. 17-35
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Formulas in intuitionistic propositional calculus and its subsystems are studied that cannot be decomposed into a proper conjunction.
[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