Weak Arithmetics and Kripke Models

Mathematical Logic Quarterly 48 (1):157-160 (2002)
  Copy   BIBTEX

Abstract

In the first section of this paper we show that i Π1 ≡ W⌝⌝lΠ1 and that a Kripke model which decides bounded formulas forces iΠ1 if and only if the union of the worlds in any path in it satisflies IΠ1. In particular, the union of the worlds in any path of a Kripke model of HA models IΠ1. In the second section of the paper, we show that for equivalence of forcing and satisfaction of Πm-formulas in a linear Kripke model deciding Δ0-formulas it is necessary and sufficient that the model be Σm-elementary. This implies that if a linear Kripke model forces PEMprenex, then it forces PEM. We also show that, for each n ≥ 1, iΦn does not prove ℋ(IΠn's are Burr's fragments of HA

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Corrigendum to "Weak Arithmetics and Kripke Models".Morteza Moniri - 2004 - Mathematical Logic Quarterly 50 (6):637.
Intuitionistic weak arithmetic.Morteza Moniri - 2003 - Archive for Mathematical Logic 42 (8):791-796.
Classical and Intuitionistic Models of Arithmetic.Kai F. Wehmeier - 1996 - Notre Dame Journal of Formal Logic 37 (3):452-461.
On the structure of kripke models of heyting arithmetic.Zoran Marković - 1993 - Mathematical Logic Quarterly 39 (1):531-538.
Submodels of Kripke models.Albert Visser - 2001 - Archive for Mathematical Logic 40 (4):277-295.
Homomorphisms and chains of Kripke models.Morteza Moniri & Mostafa Zaare - 2011 - Archive for Mathematical Logic 50 (3-4):431-443.
A Note on Recursive Models of Set Theories.Domenico Zambella & Antonella Mancini - 2001 - Notre Dame Journal of Formal Logic 42 (2):109-115.
Nonstandard Models and Kripke's Proof of the Gödel Theorem.Hilary Putnam - 2000 - Notre Dame Journal of Formal Logic 41 (1):53-58.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
Models of intuitionistic TT and N.Daniel Dzierzgowski - 1995 - Journal of Symbolic Logic 60 (2):640-653.
Kripke semantics for provability logic GLP.Lev D. Beklemishev - 2010 - Annals of Pure and Applied Logic 161 (6):756-774.

Analytics

Added to PP
2013-12-01

Downloads
202 (#98,608)

6 months
59 (#80,125)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Fragments of $HA$ based on $\Sigma_1$ -induction.Kai F. Wehmeier - 1997 - Archive for Mathematical Logic 37 (1):37-49.
Intuitionistic validity in T-normal Kripke structures.Samuel R. Buss - 1993 - Annals of Pure and Applied Logic 59 (3):159-173.
Fragments of Heyting arithmetic.Wolfgang Burr - 2000 - Journal of Symbolic Logic 65 (3):1223-1240.
Classical and Intuitionistic Models of Arithmetic.Kai F. Wehmeier - 1996 - Notre Dame Journal of Formal Logic 37 (3):452-461.

Add more references