Kripke Models Built from Models of Arithmetic
نویسنده
چکیده
We introduce three relations between models of Peano Arithmetic (PA), each of which is characterized as an arithmetical accessibility relation. A relation R is said to be an arithmetical accessibility relation if for any modelM of PA,M Prπ(φ) iffM′ φ for allM′ withM RM′, where Prπ(x) is an intensionally correct provability predicate of PA. The existence of arithmetical accessibility relations yields a new perspective on the arithmetical completeness of GL. We show that any finite Kripke model for GL is bisimilar to some “arithmetical” Kripke model whose domain consists of models of PA and whose accessibility relation is an arithmetical accessibility relation. This yields a new interpretation of the modal operators in the context of PA: an arithmetical assertion φ is consistent (possible, ♦φ) if it holds in some arithmetically accessible model, and provable (necessary, φ) if it holds in all arithmetically accessible models.
منابع مشابه
Intuitionistic axiomatizations for bounded extension Kripke models
We present axiom systems, and provide soundness and strong completeness theorems, for classes of Kripke models with restricted extension rules among the node structures of the model. As examples we present an axiom system for the class of co5nal extension Kripke models, and an axiom system for the class of end-extension Kripke models. We also show that Heyting arithmetic (HA) is strongly comple...
متن کاملIndependence results for weak systems of intuitionistic arithmetic
This paper proves some independence results for weak fragments of Heyting arithmetic by using Kripke models. We present a necessary condition for linear Kripke models of arithmetical theories which are closed under the negative translation and use it to show that the union of the worlds in any linear Kripke model of HA satisfies PA. We construct a two-node PA-normal Kripke structure which does ...
متن کاملA new perspective on the arithmetical completeness of GL ∗
Solovay’s proof of the arithmetical completeness of the provability logic GL proceeds by simulating a finite Kripke model inside the theory of Peano Arithmetic (PA). In this article, a new perspective on the proof of GL’s arithmetical completeness will be given. Instead of simulating a Kripke structure inside the theory of PA, it will be embedded into an arithmetically defined Kripke structure....
متن کاملCuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملModel theory of bounded arithmetic with applications to independence results
In this paper we apply some new and some old methods in order to construct classical and intuitionistic models for theories of bounded arithmetic. We use these models to obtain proof theoretic consequences. In particular, we construct an ωchain of models of BASIC such that the union of its worlds satisfies S2 but none of its worlds satisfies the sentence ∀x∃y(x = 0 ∨ x = y + 1). Interpreting th...
متن کامل