A certain class of models of peano arithmetic

Journal of Symbolic Logic 48 (2):311-320 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

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,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
81 (#278,688)

6 months
11 (#332,542)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Neutrally expandable models of arithmetic.Athar Abdul‐Quader & Roman Kossak - 2019 - Mathematical Logic Quarterly 65 (2):212-217.
Indiscernibles and satisfaction classes in arithmetic.Ali Enayat - 2024 - Archive for Mathematical Logic 63 (5):655-677.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Undefinability of truth and nonstandard models.Roman Kossak - 2004 - Annals of Pure and Applied Logic 126 (1-3):115-123.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references