Automorphism Groups of Arithmetically Saturated Models

Journal of Symbolic Logic 71 (1):203 - 216 (2006)
  Copy   BIBTEX

Abstract

In this paper we study the automorphism groups of countable arithmetically saturated models of Peano Arithmetic. The automorphism groups of such structures form a rich class of permutation groups. When studying the automorphism group of a model, one is interested to what extent a model is recoverable from its automorphism group. Kossak-Schmerl [12] show that ifMis a countable, arithmetically saturated model of Peano Arithmetic, then Aut(M) codes SSy(M). Using that result they prove:Let M1. M2be countable arithmetically saturated models of Peano Arithmetic such that Aut(M1)≅ Aut(M2).ThenSSy(M1) = SSy(M2).We show that ifMis a countable arithmetically saturated of Peano Arithmetic, then Aut(M) can recognize if some maximal open subgroup is a stabilizer of a nonstandard element, which is smaller than any nonstandard definable element. That fact is used to show the main theorem:Let M1,M2be countable arithmetically saturated models of Peano Arithmetic such thatAut(M1) ≅ Aut(M2).Then for every n<ωHere RT2nis Infinite Ramsey's Theorem stating that every 2-coloring of [ω]nhas an infinite homogeneous set. Theorem 0.2 shows that for models of a false arithmetic the converse of Kossak-Schmerl Theorem 0.1 is not true. Using the results of Reverse Mathematics we obtain the following corollary:There exist four countable arithmetically saturated models of Peano Arithmetic such that they have the same standard system but their automorphism groups are pairwise non-isomorphic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,354

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2010-08-24

Downloads
17 (#878,752)

6 months
9 (#449,120)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Ultrafilters and types on models of arithmetic.L. A. S. Kirby - 1984 - Annals of Pure and Applied Logic 27 (3):215-252.

View all 7 references / Add more references