Subrecursive degrees and fragments of Peano Arithmetic
β Scribed by Lars Kristiansen
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 243 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we study the automorphism groups of models of Peano Arithmetic. Kossak, Kotlarski, and Schmerl [9] shows that the stabilizer of an unbounded element a of a countable recursively saturated model of Peano Arithmetic M is a maximal subgroup of Aut(M ) if and only if the type of a is selec
Paris and C. Dimitracopoulos, the class of the Ξ n+1-sentences true in the standard model is the only (up to deductive equivalence) consistent Ξ n+1-theory which extends the scheme of induction for parameter free Ξ n+1-formulas. Motivated by this result, we present a systematic study of extensions of b
PA we define the rfcursively saturated part of XU by RS(9Jl) = ( a E $1: ( 3 8 < YJ?) ( a E )%I and 8 is recursively saturated)). We shall study various possibilities for the relationship between 912 and RS(XU). Tliii paper has grown out of our observation that it may happen that , D is a simple ex