An application of a reflection principle

Zofia Adamowicz; Leszek Aleksander Kołodziejczyk; Paweł Zbierski

Fundamenta Mathematicae (2003)

  • Volume: 180, Issue: 2, page 139-159
  • ISSN: 0016-2736

Abstract

top
We define a recursive theory which axiomatizes a class of models of IΔ₀ + Ω ₃ + ¬ exp all of which share two features: firstly, the set of Δ₀ definable elements of the model is majorized by the set of elements definable by Δ₀ formulae of fixed complexity; secondly, Σ₁ truth about the model is recursively reducible to the set of true Σ₁ formulae of fixed complexity.

How to cite

top

Zofia Adamowicz, Leszek Aleksander Kołodziejczyk, and Paweł Zbierski. "An application of a reflection principle." Fundamenta Mathematicae 180.2 (2003): 139-159. <http://eudml.org/doc/283250>.

@article{ZofiaAdamowicz2003,
abstract = {We define a recursive theory which axiomatizes a class of models of IΔ₀ + Ω ₃ + ¬ exp all of which share two features: firstly, the set of Δ₀ definable elements of the model is majorized by the set of elements definable by Δ₀ formulae of fixed complexity; secondly, Σ₁ truth about the model is recursively reducible to the set of true Σ₁ formulae of fixed complexity.},
author = {Zofia Adamowicz, Leszek Aleksander Kołodziejczyk, Paweł Zbierski},
journal = {Fundamenta Mathematicae},
keywords = {fragments of arithmetic; bounded induction; definable elements},
language = {eng},
number = {2},
pages = {139-159},
title = {An application of a reflection principle},
url = {http://eudml.org/doc/283250},
volume = {180},
year = {2003},
}

TY - JOUR
AU - Zofia Adamowicz
AU - Leszek Aleksander Kołodziejczyk
AU - Paweł Zbierski
TI - An application of a reflection principle
JO - Fundamenta Mathematicae
PY - 2003
VL - 180
IS - 2
SP - 139
EP - 159
AB - We define a recursive theory which axiomatizes a class of models of IΔ₀ + Ω ₃ + ¬ exp all of which share two features: firstly, the set of Δ₀ definable elements of the model is majorized by the set of elements definable by Δ₀ formulae of fixed complexity; secondly, Σ₁ truth about the model is recursively reducible to the set of true Σ₁ formulae of fixed complexity.
LA - eng
KW - fragments of arithmetic; bounded induction; definable elements
UR - http://eudml.org/doc/283250
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.