Weak arithmetics and Kripke models

From MaRDI portal





The paper contains two main results. The first shows that the intuitionistic least number principle for \(\Pi_1\) formulas is equivalent to the intuitionistic induction scheme for \(\Pi_1\) formulas. The other result is a characterization of those linear Kripke structures which decide all \(\Delta_0\)-formulas, and in which forcing and satisfaction for \(\Pi_n\) formulas coincide. As a corollary, it is shown that a linear Kripke model which satisfies the Principle of Excluded Middle for formulas in prenex normal form, satisfies the Principle of Excluded Middle for all formulas.











This page was built for publication: Weak arithmetics and Kripke models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776821)