You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Arithmetical Interpretations of Dynamic Logic
The Journal of Symbolic Logic
Vol. 48, No. 3 (Sep., 1983), pp. 704-713
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2273463
Page Count: 10
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
An arithmetical interpretation of dynamic propositional logic (DPL) is a mapping f satisfying the following: (1) f associates with each formula A of DPL a sentence f(A) of Peano arithmetic (PA) and with each program α a formula f(α) of PA with one free variable describing formally a supertheory of PA; (2) f commutes with logical connectives; (3) f([α] A) is the sentence saying that f(A) is provable in the theory f(α); (4) for each axiom A of DPL, f(A) is provable in PA (and consequently, for each A provable in DPL, f(A) is provable in PA). The arithmetical completeness theorem is proved saying that a formula A of DPL is provable in DPL iff for each arithmetical interpretation f, f(A) is provable in PA. Various modifications of this result are considered.
The Journal of Symbolic Logic © 1983 Association for Symbolic Logic