Automorphisms of models of arithmetic: a unified view

Annals of Pure and Applied Logic 145 (1):16-36 (2007)

Abstract
We develop the method of iterated ultrapower representation to provide a unified and perspicuous approach for building automorphisms of countable recursively saturated models of Peano arithmetic . In particular, we use this method to prove Theorem A below, which confirms a long-standing conjecture of James Schmerl.Theorem AIf is a countable recursively saturated model of in which is a strong cut, then for any there is an automorphism j of such that the fixed point set of j is isomorphic to .We also fine-tune a number of classical results. One of our typical results in this direction is Theorem B below, which generalizes a theorem of Kaye–Kossak–Kotlarski .Theorem BSuppose is a countable recursively saturated model of in which is a strong cut. There is a group embedding from into such that for each that is fixed point free, moves every undefinable element of
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2006.05.013
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 47,330
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Some Applications of Iterated Ultrapowers in Set Theory.Kenneth Kunen - 1970 - Annals of Pure and Applied Logic 1 (2):179.
Models and Types of Peano's Arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Partition Theorems and Computability Theory.Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3):411-427.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.

View all 15 references / Add more references

Citations of this work BETA

Iterated Ultrapowers for the Masses.Ali Enayat, Matt Kaufmann & Zachiri McKenzie - 2018 - Archive for Mathematical Logic 57 (5-6):557-576.

Add more citations

Similar books and articles

Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
On Automorphisms of Resplendent Models of Arithmetic.Zofia Seremet - 1984 - Mathematical Logic Quarterly 30 (19‐24):349-352.
Les Beaux Automorphismes.Daniel Lascar - 1991 - Archive for Mathematical Logic 31 (1):55-68.
The Theory of $\Kappa$ -Like Models of Arithmetic.Richard Kaye - 1995 - Notre Dame Journal of Formal Logic 36 (4):547-559.
Interstitial and Pseudo Gaps in Models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.
Generic Cuts in Models of Arithmetic.Richard Kaye - 2008 - Mathematical Logic Quarterly 54 (2):129-144.
Subsets of Models of Arithmetic.Roman Kossak & Jeffrey B. Paris - 1992 - Archive for Mathematical Logic 32 (1):65-73.

Analytics

Added to PP index
2013-12-30

Total views
10 ( #782,084 of 2,291,029 )

Recent downloads (6 months)
3 ( #402,142 of 2,291,029 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature