𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence results for weak systems of intuitionistic arithmetic

✍ Scribed by Morteza Moniri


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
112 KB
Volume
49
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

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 not force iΞ£~2~. We prove iβˆ€~1~ ⊬ iβˆƒ~1~, iβˆƒ~1~ ⊬ iβˆ€~1~, iΞ ~2~ ⊬ iΞ£~2~ and iΞ£~2~ ⊬ iΞ ~2~. We use Smorynski's operation Ξ£β€² to show HA ⊬ lΞ ~1~.


πŸ“œ SIMILAR VOLUMES


A Remark on Independence Results for Sha
✍ Jan Johannsen πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 193 KB

The purpose of this note is to show that the independence results for sharply bounded arithmetic of Takeuti [4] and Tada and Tatsuta [3] can be obtained and, in case of the latter, improved by the model-theoretic method developed by the author in [2].

A generalization of a conservativity the
✍ Stefano Berardi πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 124 KB

## Abstract A basic result in intuitionism is Ξ ^0^~2~‐conservativity. Take any proof __p__ in classical arithmetic of some Ξ ^0^~2~‐statement (some arithmetical statement βˆ€__x__.βˆƒ__y__.__P__(__x, y__), with __P__ decidable). Then we may effectively turn __p__ in some intuitionistic proof of the same