On two questions concerning the automorphism groups of countable recursively saturated models of PA

&
Archive for Mathematical Logic 36 (1):73-79 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/s001530050056

Links

PhilArchive



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

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 Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
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.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
On interstices of countable arithmetically saturated models of Peano arithmetic.Nicholas Bamber & Henryk Kotlarski - 1997 - Mathematical Logic Quarterly 43 (4):525-540.
Automorphisms moving all non-algebraic points and an application to NF.Friederike Körner - 1998 - Journal of Symbolic Logic 63 (3):815-830.
A Galois correspondence for countable short recursively saturated models of PA.Erez Shochat - 2010 - Mathematical Logic Quarterly 56 (3):228-238.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
On maximal subgroups of the automorphism group of a countable recursively saturated model of PA.Roman Kossak, Henryk Kotlarski & James H. Schmerl - 1993 - Annals of Pure and Applied Logic 65 (2):125-148.
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.
Automorphism group actions on trees.Alexandre Ivanov & Roman Kossak - 2004 - Mathematical Logic Quarterly 50 (1):71.
A generalization of the Keisler-Morley theorem to recursively saturated ordered structures.Shahram Mohsenipour - 2007 - Mathematical Logic Quarterly 53 (3):289-294.
On automorphism groups of countable structures.Su Gao - 1998 - Journal of Symbolic Logic 63 (3):891-896.

Analytics

Added to PP
2013-11-23

Downloads
34 (#470,521)

6 months
11 (#238,317)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Automorphisms of models of arithmetic: a unified view.Ali Enayat - 2007 - Annals of Pure and Applied Logic 145 (1):16-36.
Truth in generic cuts.Richard Kaye & Tin Lok Wong - 2010 - Annals of Pure and Applied Logic 161 (8):987-1005.
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.
Automorphism group actions on trees.Alexandre Ivanov & Roman Kossak - 2004 - Mathematical Logic Quarterly 50 (1):71.

View all 6 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.

View all 6 references / Add more references