Hostname: page-component-848d4c4894-8kt4b Total loading time: 0 Render date: 2024-06-17T01:28:57.993Z Has data issue: false hasContentIssue false

S. N. Artemov. Arithmetically complete modal theories. Six papers in logic, American Mathematical Society translations, ser. 2 vol. 135, American Mathematical Society, Providence1987, pp. 39–54. (English translation by B. M. Schein of Arifmeticheski polnye modal'nye teorii, Semiotika i informatika (Moscow), vol. 14 (for 1979, pub. 1980), pp. 115–133.) - S. N. Artemov. On modal logics axiomatizing provability. Mathematics of the USSR—Izvestiya, vol. 27 no. 3 (for 1986, pub. 1987), pp. 401–429. (English translation by E. Mendelson of O modal'nykh logikakh, aksiomatiziruyushchikh dokazuemost', Izvestiya Akademii Nauk SSSR, Seriya matematicheskaya, vol. 49 (1985), pp. 1123–1154.) - S. N. Artemov. Nonarithmeticity of truth predicate logics of provability. Soviet mathematics—Doklady, vol. 32 (for 1985, pub. 1986), pp. 403–405. (English translation by E. Mendelson of Nearifmetichnost' istinnostnykh predikatnykh logik dokazuemosti, Doklady Academii Nauk SSSR, vol. 284 (1985), pp. 270–271.) - V. A. Vardanyan. Arithmetic complexity of predicate logics of provability and their fragments. Soviet mathematics—Doklady, vol. 33 no. 3 (for 1986, pub. 1987), pp. 569–572. (English translation by E. Mendelson of Arifmeticheskaya slozhnost' predikatnykh logik dokazuemosti i ikh fragmentov, Doklady Akademii Nauk SSSR, vol. 288 (1986), pp. 11–14.) - S. N. Artemov. Numerically correct provability logics. Soviet mathematics—Doklady, vol. 34 (1987), pp. 384–387. (English translation by E. Mendelson of Numericheski korrektnye logiki dokazuemosti, Doklady Akademii Nauk SSSR, vol. 290 (1986), pp. 1289–1292.)

Published online by Cambridge University Press:  12 March 2014

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Copyright
Copyright © Association for Symbolic Logic 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)