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)

Categories

Keywords

Reprint years

DOI

10.2307/2273548

Links

PhilArchive



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

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

The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
A note on the multiplicative semigroup of models of peano arithmetic.Roman Kossak, Mark Nadel & James Schmerl - 1989 - Journal of Symbolic Logic 54 (3):936-940.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
Minimal satisfaction classes with an application to rigid models of Peano arithmetic.Roman Kossak & James H. Schmerl - 1991 - Notre Dame Journal of Formal Logic 32 (3):392-398.
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.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Some remarks on initial segments in models of peano arithmetic.Henryk Kotlarski - 1984 - Journal of Symbolic Logic 49 (3):955-960.

Analytics

Added to PP
2009-01-28

Downloads
50 (#303,392)

6 months
6 (#417,196)

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.
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.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references