On the classification of propositional provability logics
Izvestiya. Mathematics , Tome 35 (1990) no. 2, pp. 247-275
Voir la notice de l'article provenant de la source Math-Net.Ru
The general notion of a modal propositional provability logic was introduced by
S. N. Artëmov (1979) and A. Visser (1984). In this paper it is proved that the four infinite series of provability logics known at the present time – $\operatorname{GL}_\alpha$, $\operatorname{GL}_\beta^-$, $S_\beta$, and $D_\beta$ ($\alpha,\beta\subseteq\omega$, $\omega\setminus\beta$ finite) – include all such logics.
Bibliography: 14 titles.
@article{IM2_1990_35_2_a0,
author = {L. D. Beklemishev},
title = {On the classification of propositional provability logics},
journal = {Izvestiya. Mathematics },
pages = {247--275},
publisher = {mathdoc},
volume = {35},
number = {2},
year = {1990},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_1990_35_2_a0/}
}
L. D. Beklemishev. On the classification of propositional provability logics. Izvestiya. Mathematics , Tome 35 (1990) no. 2, pp. 247-275. http://geodesic.mathdoc.fr/item/IM2_1990_35_2_a0/