On~modal logics axiomatizing provability
Izvestiya. Mathematics , Tome 27 (1986) no. 3, pp. 401-429
Voir la notice de l'article provenant de la source Math-Net.Ru
On the basis of the concept of the trace of a modal logic, introduced earlier by the author, a classification of arithmetically complete modal logics is given. It is proved that, between the least and the greatest arithmetically complete logics, there are continuum many logics which are not arithmetically complete.
Bibliography: 17 titles.
@article{IM2_1986_27_3_a0,
author = {S. N. Artemov},
title = {On~modal logics axiomatizing provability},
journal = {Izvestiya. Mathematics },
pages = {401--429},
publisher = {mathdoc},
volume = {27},
number = {3},
year = {1986},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_1986_27_3_a0/}
}
S. N. Artemov. On~modal logics axiomatizing provability. Izvestiya. Mathematics , Tome 27 (1986) no. 3, pp. 401-429. http://geodesic.mathdoc.fr/item/IM2_1986_27_3_a0/