Automorphisms of countable recursively saturated models

From Peano's Parlour
Revision as of 09:46, 18 January 2013 by Rkossak (Talk | contribs) (Created page with " == Extending automorphisms == Let G be the automorphism group of a countable recursively saturated model of PA. For every nontrivial fG there is a countable recursiv...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Extending automorphisms

Let G be the automorphism group of a countable recursively saturated model of PA. For every nontrivial fG there is a countable recursively saturated elementary end extension N such that f has no extension to an automorphism of N. It is open whether there an fG such that for all countable recursively saturated elementary end extension N such that M\eeN, f has no extention to an \au\ of N?


If S is an inductive partial satisfaction class of M, and fAut(M,S), then there is a countable recursively saturated elementary end extension N such that f extends to an automorphism of N. If M is arithmetically saturated, then there are fG such that for every inductive partial satisfaction class S of M, fAut(M,S). Problem: what if M is not arithmetically saturated?