The strength of sharply bounded induction
✍ Scribed by Emil Jeřábek
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 186 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We prove that the sharply bounded arithmetic T^0^~2~ in a language containing the function symbol ⌊x /2^y^ ⌋ (often denoted by MSP) is equivalent to PV~1~. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
📜 SIMILAR VOLUMES
We define a property of substructures of models of arithmetic, that of being length-initial, and show that sharply bounded formulae are absolute between a model and its length-initial submodels. We use this to prove independence results for some weak fragments of bounded arithmetic by constructing a
## Dedicated to G. Zappa on his 70th birthday \* Research done within the activity of GNSAGA of CNR, supported by the 40% grants of MPI.