Pointwise definable substructures of models of Peano arithmetic

Notre Dame Journal of Formal Logic 29 (3):295-308 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

External links

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

Through your library

Similar books and articles

Model-theoretic properties characterizing peano arithmetic.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (3):949-963.
Submodels and definable points in models of Peano arithmetic.Žarko Mijajlović - 1983 - Notre Dame Journal of Formal Logic 24 (4):417-425.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.

Analytics

Added to PP
2010-08-24

Downloads
22 (#714,863)

6 months
8 (#373,162)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Definable sets and expansions of models of Peano arithmetic.Roman Murawski - 1988 - Archive for Mathematical Logic 27 (1):21-33.
A note on the variety of satisfaction classes.Roman Murawski - 1990 - Archive for Mathematical Logic 30 (2):83-89.

Add more citations

References found in this work

No references found.

Add more references