On Automorphisms of Resplendent Models of Arithmetic

Mathematical Logic Quarterly 30 (19-24):349-352 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19840301911

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: 102,964

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

On automorphisms of resplendent models of arithmetic.Zofia Seremet - 1984 - Mathematical Logic Quarterly 30 (19‐24):349-352.
| T|+‐resplendent models and the Lascar group.Enrique Casanovas & Rodrigo Peláez - 2005 - Mathematical Logic Quarterly 51 (6):626-631.
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.
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.
Boolean‐Valued Models of Set Theory with Automorphisms.E. G. Hernandez - 1986 - Mathematical Logic Quarterly 32 (7‐9):117-130.
The automorphism group of a resplendent model.James H. Schmerl - 2012 - Archive for Mathematical Logic 51 (5-6):647-649.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
Interstitial and pseudo gaps in models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.
Iterations of satisfaction classes and models of peano arithmetic.Roman Murawski - 1992 - Mathematical Logic Quarterly 38 (1):59-84.
Resplendent models and Σ11{\Sigma_1^1} -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.

Analytics

Added to PP
2013-12-01

Downloads
48 (#476,299)

6 months
4 (#886,213)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.
Elementary extensions of recursively saturated models of arithmetic.C. Smoryński - 1981 - Notre Dame Journal of Formal Logic 22 (3):193-203.

Add more references