Two theorems on degrees of models of true arithmetic

, &
Journal of Symbolic Logic 49 (2):425-436 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274174

Links

PhilArchive



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

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 certain types and models for arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.
Possible m-diagrams of models of arithmetic.Andrew Arana - 2005 - In Stephen Simpson (ed.), Reverse Mathematics 2001.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Three theorems of Godel.Andrew Boucher - manuscript
⊃E is Admissible in “true” relevant arithmetic.Robert K. Meyer - 1998 - Journal of Philosophical Logic 27 (4):327 - 351.
Representation theorems and realism about degrees of belief.Lyle Zynda - 2000 - Philosophy of Science 67 (1):45-69.
Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2011 - Notre Dame Journal of Formal Logic 52 (3):315-329.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.

Analytics

Added to PP
2009-01-28

Downloads
23 (#680,480)

6 months
6 (#514,728)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.

Add more citations

References found in this work

Add more references