On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic

Teresa Bigorajska; Henryk Kotlarski; James Schmerl

Fundamenta Mathematicae (1998)

  • Volume: 158, Issue: 2, page 125-146
  • ISSN: 0016-2736

Abstract

top
We continue the earlier research of [1]. In particular, we work out a class of regular interstices and show that selective types are realized in regular interstices. We also show that, contrary to the situation above definable elements, the stabilizer of an element inside M(0) whose type is selective need not be maximal.

How to cite

top

Bigorajska, Teresa, Kotlarski, Henryk, and Schmerl, James. "On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic." Fundamenta Mathematicae 158.2 (1998): 125-146. <http://eudml.org/doc/212307>.

@article{Bigorajska1998,
abstract = {We continue the earlier research of [1]. In particular, we work out a class of regular interstices and show that selective types are realized in regular interstices. We also show that, contrary to the situation above definable elements, the stabilizer of an element inside M(0) whose type is selective need not be maximal.},
author = {Bigorajska, Teresa, Kotlarski, Henryk, Schmerl, James},
journal = {Fundamenta Mathematicae},
keywords = {interstices; selective types; stabilizers; models of Peano arithmetic; countable arithmetically saturated models},
language = {eng},
number = {2},
pages = {125-146},
title = {On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic},
url = {http://eudml.org/doc/212307},
volume = {158},
year = {1998},
}

TY - JOUR
AU - Bigorajska, Teresa
AU - Kotlarski, Henryk
AU - Schmerl, James
TI - On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic
JO - Fundamenta Mathematicae
PY - 1998
VL - 158
IS - 2
SP - 125
EP - 146
AB - We continue the earlier research of [1]. In particular, we work out a class of regular interstices and show that selective types are realized in regular interstices. We also show that, contrary to the situation above definable elements, the stabilizer of an element inside M(0) whose type is selective need not be maximal.
LA - eng
KW - interstices; selective types; stabilizers; models of Peano arithmetic; countable arithmetically saturated models
UR - http://eudml.org/doc/212307
ER -

References

top
  1. [1] N. Bamber and H. Kotlarski, On interstices in countable arithmetically saturated models of Peano Arithmetic, Math. Logic Quart. 43 (1997), 525-540. Zbl0884.03042
  2. [2] T. Bigorajska and H. Kotlarski, A partition theorem for α-large sets, to appear. Zbl0933.03055
  3. [3] P. Erdős and R. Rado, A combinatorial theorem, J. London Math. Soc. 25 (1950), 249-255. 
  4. [4] R. Graham, B. Rothschild and J. Spencer, Ramsey Theory, 2nd ed., Wiley, 1990. 
  5. [5] A. Grzegorczyk, Some classes of recursive functions, Dissertationes Math. 4 (1953). Zbl0052.24902
  6. [6] P. Hájek and P. Pudlák, Metamathematics of First Order Arithmetic, Perspect. Math. Logic, Springer, 1993. Zbl0781.03047
  7. [7] R. Kaye, Models of Peano Arithmetic, Oxford Logic Guides, Oxford Univ. Press, 1991. Zbl0744.03037
  8. [8] R. Kaye, R. Kossak and H. Kotlarski, Automorphisms of recursively saturated models of arithmetic, Ann. Pure Appl. Logic 55 (1991), 67-91. Zbl0748.03023
  9. [9] J. Ketonen and R. Solovay, Rapidly growing Ramsey functions, Ann. of Math. 113 (1981), 267-314. Zbl0494.03027
  10. [10] R. Kossak, H. Kotlarski and J. Schmerl, On maximal subgroups of the automorphism group of a countable recursively saturated model of Peano arithmetic, Ann. Pure Appl. Logic 65 (1993), 125-148. Zbl0796.03043
  11. [11] R. Kossak and J. Schmerl, The automorphism group of an arithmetically saturated model of Peano arithmetic, J. London Math. Soc. (2) 52 (1995), 235-244. Zbl0905.03024
  12. [12] R. Kossak and J. Schmerl, Arithmetically saturated models of arithmetic, Notre Dame J. Formal Logic 36 (1995), 531-546. Zbl0848.03017
  13. [13] H. Kotlarski, On elementary cuts in recursively saturated models of arithmetic, Fund. Math. 120 (1984), 205-222. Zbl0572.03016
  14. [14] H. Kotlarski, Automorphisms of countable recursively saturated models of PA: a survey, Notre Dame J. Formal Logic 36 (1995), 505-518. Zbl0848.03015
  15. [15 H. Kotlarski and R. Kaye, Automorphisms of models of True Arithmetic: recognising some basic open subgroups, ibid. 35 (1994), 1-14. Zbl0824.03016
  16. [16] H. Kotlarski and Z. Ratajczyk, Inductive full satisfaction classes, Ann. Pure Appl. Logic 47 (1990), 199-223. Zbl0708.03014
  17. [17] H. Kotlarski and Z. Ratajczyk, More on induction in the language with a satisfaction class, Z. Math. Logik 36 (1990), 441-454. Zbl0723.03033
  18. [18] W. Pohlers, Proof Theory, Lecture Notes in Math. 1047, Springer, 1989. 
  19. [19] Z. Ratajczyk, A combinatorial analysis of functions provably recursive in I Σ n , Fund. Math. 130 (1988), 191-213. 
  20. [20] Z. Ratajczyk, Subsystems of true arithmetic and hierarchies of functions, Ann. Pure Appl. Logic 64 (1993), 95-152. Zbl0802.03036
  21. [21] H. Rogers, The Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967. Zbl0183.01401
  22. [22] D. Scott, Algebras of sets binumerable in complete extensions of arithmetic, in: Recursive Function Theory, Amer. Math. Soc., Providence, 1962, 117-121. 
  23. [23] R. Sommer, Transfinite induction within Peano arithmetic, Ann. Pure Appl. Logic 76 (1995), 231-289. Zbl0858.03056

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.