Minimal satisfaction classes with an application to rigid models of Peano arithmetic

&
Notre Dame Journal of Formal Logic 32 (3):392-398 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093635835

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: 106,126

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

Full Satisfaction Classes, Definability, and Automorphisms.Bartosz Wcisło - 2022 - Notre Dame Journal of Formal Logic 63 (2):143-163.
Iterations of satisfaction classes and models of peano arithmetic.Roman Murawski - 1992 - Mathematical Logic Quarterly 38 (1):59-84.
Pointwise definable substructures of models of Peano arithmetic.Roman Murawski - 1988 - Notre Dame Journal of Formal Logic 29 (3):295-308.
Submodels and definable points in models of Peano arithmetic.Žarko Mijajlović - 1983 - Notre Dame Journal of Formal Logic 24 (4):417-425.
Book review: Richard Kaye. Models of Peano arithmetic. [REVIEW]Lawrence Kiry - 1992 - Notre Dame Journal of Formal Logic 33 (3):461-463.
On closed elementary cuts in recursively saturated models of Peano arithmetic.Bożena Piekart - 1993 - Notre Dame Journal of Formal Logic 34 (2):223-230.
The Diversity of Minimal Cofinal Extensions.James H. Schmerl - 2022 - Notre Dame Journal of Formal Logic 63 (4):493-514.
Interstitial and pseudo gaps in models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.

Analytics

Added to PP
2010-08-24

Downloads
26 (#944,358)

6 months
5 (#853,064)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Full Satisfaction Classes, Definability, and Automorphisms.Bartosz Wcisło - 2022 - Notre Dame Journal of Formal Logic 63 (2):143-163.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Undefinability of truth and nonstandard models.Roman Kossak - 2004 - Annals of Pure and Applied Logic 126 (1-3):115-123.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references