Journal of Symbolic Logic 48 (3):704-713 (1983)
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
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
Semantical Analysis of Modal Logic I. Normal Propositional Calculi.Saul A. Kripke - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (5‐6):67-96.
Citations of this work BETA
No citations found.
Similar books and articles
Dynamic Relation Logic is the Logic of DPL-Relations.Albert Visser - 1997 - Journal of Logic, Language and Information 6 (4):441-452.
Contexts in Dynamic Predicate Logic.Albert Visser - 1998 - Journal of Logic, Language and Information 7 (1):21-52.
The Donkey and the Monoid. Dynamic Semantics with Control Elements.Albert Visser - 2002 - Journal of Logic, Language and Information 11 (1):107-131.
Arithmetical Completeness Versus Relative Completeness.Michal Grabowski - 1988 - Studia Logica 47 (3):213 - 220.
Predicate Provability Logic with Non-Modalized Quantifiers.Giorgie Dzhaparidze - 1991 - Studia Logica 50 (1):149 - 160.
Added to index2009-01-28
Total downloads9 ( #463,573 of 2,171,693 )
Recent downloads (6 months)1 ( #326,424 of 2,171,693 )
How can I increase my downloads?