On maximal subgroups of the automorphism group of a countable recursively saturated model of PA

, &
Annals of Pure and Applied Logic 65 (2):125-148 (1993)
  Copy   BIBTEX

Abstract

We show that the stabilizer of an element a of a countable recursively saturated model of arithmetic M is a maximal subgroup of Aut iff the type of a is selective. This is a point of departure for a more detailed study of the relationship between pointwise and setwise stabilizers of certain subsets of M and the types of elements in those subsets. We also show that a complete type of PA is 2-indiscernible iff it is minimal in the sense of Gaifman

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(93)90035-c

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

External links

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

Through your library

My notes

Similar books and articles

Interstitial and pseudo gaps in models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.
A Galois correspondence for countable short recursively saturated models of PA.Erez Shochat - 2010 - Mathematical Logic Quarterly 56 (3):228-238.
Automorphisms of recursively saturated models of arithmetic.Richard Kaye, Roman Kossak & Henryk Kotlarski - 1991 - Annals of Pure and Applied Logic 55 (1):67-99.
Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely.Henryk Kotlarski & Bożena Piekart - 1994 - Mathematical Logic Quarterly 40 (1):95-102.
Automorphism Groups of Arithmetically Saturated Models.Ermek S. Nurkhaidarov - 2006 - Journal of Symbolic Logic 71 (1):203 - 216.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Decoding in the automorphism group of a recursively saturated model of arithmetic.Ermek Nurkhaidarov - 2015 - Mathematical Logic Quarterly 61 (3):179-188.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Automorphisms of models of arithmetic: a unified view.Ali Enayat - 2007 - Annals of Pure and Applied Logic 145 (1):16-36.

Analytics

Added to PP
2014-01-16

Downloads
21 (#1,105,144)

6 months
5 (#853,286)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.

View all 14 citations / Add more citations

References found in this work

Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Ultrafilters and types on models of arithmetic.L. A. S. Kirby - 1984 - Annals of Pure and Applied Logic 27 (3):215-252.

Add more references