| A.V. Kuznetsov and A.Yu. Muravitsky, "The logic of provability", Abstracts of the 4-th All-Union Conference on Mathematical Logic, p. 73, (Russian), 1976. |
....in PA, which is false according to the second Godel incompleteness theorem. In [26] cf. 59] Godel again acknowledged the problem of the provability semantics for S4. This issue was also addressed by Lemmon [44] Myhill [55] 56] Kripke [40] Montague [54] Mints [52] Kuznetsov Muravitsky [43], Goldblatt [27] Boolos [12] 14] Shapiro [62] 63] Buss [17] Artemov [1] and many others. However, the problem of finding an adequate provability semantics for S4 has remained open. A principal difficulty here is caused by the existential quantifier over proofs in the provability formula ....
A.V. Kuznetsov and A.Yu. Muravitsky, "The logic of provability", Abstracts of the 4-th All-Union Conference on Mathematical Logic, p. 73, (Russian), 1976.
....The latter formula expresses the assertion that Consis PA is provable in PA, which contradicts the Second Godel Incompleteness Theorem. The issue of a provability model for S4 was studied by Godel [18] Lemmon [29] Myhill [39] 40] Kripke [26] Montague [38] Mints [35] Kuznetsov Muravitskii [28], Goldblatt [19] Boolos [9] 10] Shapiro [43] 44] Buss [12] Artemov [1] and many others. However, the problem of a formal provability semantics for S4 has remained open. A principal difficulty here is caused by the existential quantifier over proofs in Provable(F ) Indeed, the interpretation ....
A.V. Kuznetsov and A.Yu. Muravitsky, "The logic of provability", Abstracts of the 4-th All-Union Conference on Mathematical Logic, p. 73, (Russian), 1976. 57
....The latter formula expresses the assertion that Consis PA is provable in PA, which contradicts the Second Godel Incompleteness Theorem. The issue of a provability model for S4 was studied by Godel [13] Lemmon [20] Myhill [27] 28] Kripke [18] Montague [26] Mints [25] Kuznetsov Muravitskii [19], Goldblatt [14] Boolos [7] 8] Shapiro [30] 31] Buss [9] Artemov [1] and many others. However, the problem of a formal provability semantics for S4 has remained open. A principal difficulty here is caused by the existential quantifier over proofs in Provable(F ) Indeed, the interpretation ....
A.V. Kuznetsov and A.Yu. Muravitsky, "The logic of provability", Abstracts of the 4-th All-Union Conference on Mathematical Logic, p. 73, (Russian), 1976.
....The latter formula expresses the assertion that Consis PA is provable in PA, which contradicts the second Godel incompleteness theorem. The issue of a provability model for S4 was studied by Godel [16] Lemmon [28] Myhill [35] 36] Kripke [25] Montague [34] Mints [33] Kuznetsov Muravitskii [27], Goldblatt [17] Boolos [9] 10] Shapiro [38] 39] Buss [11] Artemov [1] and many others. However, the problem of a formal provability semantics for S4 has remained open. A principal difficulty here is caused by the existential quantifier over proofs in Provable(F ) Indeed, the interpretation ....
A.V. Kuznetsov and A.Yu. Muravitsky, "The logic of provability", Abstracts of the 4-th All-Union Conference on Mathematical Logic, p. 73, (Russian), 1976.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC