Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Classification Theory and $0^\#$

Sy D. Friedman, Tapani Hyttinen and Mika Rautila
The Journal of Symbolic Logic
Vol. 68, No. 2 (Jun., 2003), pp. 580-588
Stable URL: http://www.jstor.org/stable/4147697
Page Count: 9
  • Get Access
  • Read Online (Free)
  • Download ($10.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Classification Theory and $0^\#$
Preview not available

Abstract

We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [2]) of the potential-isomorphism problem for models of T.

Page Thumbnails

  • Thumbnail: Page 
580
    580
  • Thumbnail: Page 
581
    581
  • Thumbnail: Page 
582
    582
  • Thumbnail: Page 
583
    583
  • Thumbnail: Page 
584
    584
  • Thumbnail: Page 
585
    585
  • Thumbnail: Page 
586
    586
  • Thumbnail: Page 
587
    587
  • Thumbnail: Page 
588
    588