|
This article is cited in 9 scientific papers (total in 9 papers)
On modal logics axiomatizing provability
S. N. Artemov
Abstract:
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.
Received: 05.09.1983 Revised: 27.03.1985
Citation:
S. N. Artemov, “On modal logics axiomatizing provability”, Izv. Akad. Nauk SSSR Ser. Mat., 49:6 (1985), 1123–1154; Math. USSR-Izv., 27:3 (1986), 401–429
Linking options:
https://www.mathnet.ru/eng/im1391https://doi.org/10.1070/IM1986v027n03ABEH001183 https://www.mathnet.ru/eng/im/v49/i6/p1123
|
Statistics & downloads: |
Abstract page: | 377 | Russian version PDF: | 134 | English version PDF: | 8 | References: | 43 | First page: | 4 |
|