Journal of Symbolic Logic 48 (3):704-713 (1983)
|Abstract||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)|
|Through your library||Configure|
Similar books and articles
C. Vermeulen (2001). A Calculus of Substitutions for DPL. Studia Logica 68 (3):357-387.
Albert Visser (1997). Dynamic Relation Logic is the Logic of DPL-Relations. Journal of Logic, Language and Information 6 (4):441-452.
Petr Hájek (2001). Fuzzy Logic and Arithmetical Hierarchy III. Studia Logica 68 (1):129-142.
Albert Visser (1998). Contexts in Dynamic Predicate Logic. Journal of Logic, Language and Information 7 (1):21-52.
Albert Visser (2002). The Donkey and the Monoid. Dynamic Semantics with Control Elements. Journal of Logic, Language and Information 11 (1):107-131.
Michal Grabowski (1988). Arithmetical Completeness Versus Relative Completeness. Studia Logica 47 (3):213 - 220.
Giorgie Dzhaparidze (1991). Predicate Provability Logic with Non-Modalized Quantifiers. Studia Logica 50 (1):149 - 160.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?