| S. Artemov, Unied Semantics for Modality and -terms via Proof Polynomials, Technical Report CFIS 99-03, Cornell University, 1999. To appear in \Logic, Language and Computation'97, CSLI Publications", Stanford University, 1999. |
....c on this matter. We consider the propositional part of G odel s sketch only. 3 Artemov completeness of Int with respect to this Kreisel Goodman realizability has not been established (cf. 17] 19] 22] 2 About this talk In this tutorial talk we present a recent solutions in [1] 2] [3] (cf. also a survey [9] of the problems discussed above. 1. We give the exact intended semantics and nd a complete axiom system for the explicit provability logic sketched by G odel in 1938. We demonstrate that one more operation should be added to G odel s sketch of the explicit provability ....
S. Artemov, Unied Semantics for Modality and -terms via Proof Polynomials, Technical Report CFIS 99-03, Cornell University, 1999. To appear in \Logic, Language and Computation'97, CSLI Publications", Stanford University, 1999.
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