Summary: Let K be an arbitrary Kripke model of Heyting Arithmetic, \(\mathsf{HA}\). For every node \(k\) in K, we can view the classical structure of \(k,\mathfrak{M}_k\) as a model of some classical theory of arithmetic. Let \(\mathsf{T}\) be a classical theory in the language of arithmetic. We say K is locally \(\mathsf{T}\), iff for every \(k\) in K, \(\mathfrak{M}_k\vDash\mathsf{T}\). One of the most important problems in the model theory of \(\mathsf{HA}\) is the following question: Is every Kripke model of \(\mathsf{HA}\) locally \(\mathsf{PA}\)? We answer this question negatively. We introduce two new Kripke model constructions to this end. The first construction actually characterizes the arithmetical structures that can be the root of a Kripke model \(\mathbf{K}\Vdash\mathsf{HA}+\mathsf{EC}\mathsf{T}_0(\mathsf{EC}\mathsf{T}_0\) stands for Extended Church Thesis). The characterization says that for every arithmetical structure \(\mathfrak{M}\), there exists a rooted Kripke model \(\mathbf{K}\Vdash\mathsf{HA}+\mathsf{EC}\mathsf{T}_0\) with the root \(r\) such that \(\mathfrak{M}_r=\mathfrak{M}\) iff \(\mathfrak{M}\vDash\mathbf{Th}_{\Pi_2}(\mathsf{PA})\). One of the consequences of this characterization is that there is a rooted Kripke model \(\mathbf{K}\Vdash\mathsf{HA}+\mathsf{EC}\mathsf{T}_0\) with the root \(r\) such that \(\mathfrak{M}_r\nvDash\mathbf{I}\Delta_1\) and hence K is not even locally \(\mathbf{I}\Delta_1\). The second Kripke model construction is an implicit way of doing the first construction which works for any reasonable consistent intuitionistic arithmetical theory \(\mathsf{T}\) with a recursively enumerable set of axioms that has the existence property. We get a sufficient condition from this construction that describes when for an arithmetical structure \(\mathfrak{M}\), there exists a rooted Kripke model \(\mathbf{K}\Vdash\mathsf{T}\) with the root \(r\) such that \(\mathfrak{M}_r=\mathfrak{M}\). As applications of this sufficient condition, we construct two new Kripke models. The first one is a Kripke model \(\mathbf{K}\Vdash\mathsf{HA}+\neg\theta +\mathsf{MP}(\theta\) is an instance of \(\mathsf{EC}\mathsf{T}_0\) and \(\mathsf{MP}\) is Markov’s principle) which is not locally \(\mathbf{I}\Delta_1\). The second one is a Kripke model \(\mathbf{K}\Vdash\mathsf{HA}\) such that K forces exactly the sentences that are provable from \(\mathsf{HA}\), but it is not locally \(\mathbf{I}\Delta_1\). Also, we will prove that every countable Kripke model of intuitionistic first-order logic can be transformed into another Kripke model with the full infinite binary tree as the Kripke frame such that both Kripke models force the same sentences. So with the previous result, there is a binary Kripke model K of \(\mathsf{HA}\) such that K is not locally \(\mathbf{I}\Delta_1\).