Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely

&
Mathematical Logic Quarterly 40 (1):95-102 (1994)
  Copy   BIBTEX

Abstract

We show that if M is a countable recursively saturated model of True Arithmetic, then G = Aut has nonmaximal open subgroups with unique extension to a maximal subgroup of Aut

Categories

Keywords

Reprint years

DOI

10.1002/malq.19940400113

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,139

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

Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely.Henryk Kotlarski & Bożena Piekart - 2000 - Mathematical Logic Quarterly 46 (1):111-120.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2011 - Notre Dame Journal of Formal Logic 52 (3):315-329.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Automorphisms of Models of True Arithmetic: Recognizing Some Basic Open Subgroups.Henryk Kotlarski & Richard Kaye - 1994 - Notre Dame Journal of Formal Logic 35 (1):1-14.
Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts.Henryk Kotlarski & Bozena Piekart - 1995 - Mathematical Logic Quarterly 41 (1):138-142.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Automorphisms of recursively saturated models of arithmetic.Richard Kaye, Roman Kossak & Henryk Kotlarski - 1991 - Annals of Pure and Applied Logic 55 (1):67-99.
On interstices of countable arithmetically saturated models of Peano arithmetic.Nicholas Bamber & Henryk Kotlarski - 1997 - Mathematical Logic Quarterly 43 (4):525-540.
Automorphisms with only infinite orbits on non-algebraic elements.Grégory Duby - 2003 - Archive for Mathematical Logic 42 (5):435-447.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
The Theory of $\kappa$ -like Models of Arithmetic.Richard Kaye - 1995 - Notre Dame Journal of Formal Logic 36 (4):547-559.
Automorphisms moving all non-algebraic points and an application to NF.Friederike Körner - 1998 - Journal of Symbolic Logic 63 (3):815-830.
Les beaux automorphismes.Daniel Lascar - 1991 - Archive for Mathematical Logic 31 (1):55-68.

Analytics

Added to PP
2013-12-01

Downloads
9 (#1,154,504)

6 months
3 (#760,965)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.

Add more citations

References found in this work

Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.

Add more references