Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T02:59:35.964Z Has data issue: false hasContentIssue false

On the Optimality of Conservation Results for Local Reflection in Arithmetic

Published online by Cambridge University Press:  12 March 2014

A. Cordón-Franco
Affiliation:
Departamento Ciencias de la Computación e Inteligencia Artificial, Facultad de Matemáticas., Universidad de Sevilla, C/Tarfia, S/N, 41012 Sevilla, Spain, E-mail: acordon@us.es
A. Fernández-Margarit
Affiliation:
Departamento Ciencias de la Computación e Inteligencia Artificial, Facultad de Matemáticas., Universidad de Sevilla, C/Tarfia, S/N, 41012 Sevilla, Spain
F. F. Lara-Martín
Affiliation:
Departamento Ciencias de la Computación e Inteligencia Artificial, Facultad de Matemáticas., Universidad de Sevilla, C/Tarfia, S/N, 41012 Sevilla, Spain, E-mail: fflara@us.es

Abstract

Let T be a recursively enumerable theory extending Elementary Arithmetic EA. L. D. Beklemishev proved that the Σ2 local reflection principle for T, (T), is conservative over the Σ1 local reflection principle, (T), with respect to boolean combinations of Σ1-sentences; and asked whether this result is best possible. In this work we answer Beklemishev's question by showing that Π2-sentences are not conserved for T = EA + “f is total,” where f is any nondecreasing computable function with elementary graph. We also discuss how this result generalizes to n > 0 and obtain as an application that for n > 0, is conservative over IΣn with respect to Πn+2-sentences.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable